1844 search results - page 73 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper we present a probabilistic framework for tracking regions based on their appearance. We exploit the feature-spatial distribution of a region representing an object a...
109
click to vote
IJCAI
2007
15 years 21 days ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
132
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
ENTCS
2007
14 years 11 months ago
2007
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
169
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...