1968 search results - page 91 / 394 » The Complexity of Valued Constraint Models |
136
click to vote
INFORMS
1998
15 years 1 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
107
click to vote
CVPR
1999
IEEE
15 years 5 months ago
1999
IEEE
We formulate stereo matching as an extremal surface extraction problem. This is made possible by embedding the disparity surface inside a volume where the surface is composed of v...
120
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
109
click to vote
RISE
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...