Sciweavers

2714 search results - page 114 / 543
» On the Notion of Value Object
Sort
View
AAAI
2012
13 years 8 months ago
Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
INFORMATICALT
2006
110views more  INFORMATICALT 2006»
15 years 6 months ago
Estimation of Functional Ranges Using Standard and Inner Interval Arithmetic
New ways to estimate ranges of values of functions from standard and inner interval arithmetic have been proposed. Using the proposed ways ranges of values of mathematical test fun...
Julius Zilinskas
POPL
2006
ACM
16 years 6 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
CISSE
2008
Springer
15 years 8 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier
SFP
2001
15 years 7 months ago
Function Types in Complete Type Inference
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
Manfred Widera, Christoph Beierle