1300 search results - page 216 / 260 » Constraint satisfaction problems and global cardinality cons... |
145
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
193
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
186
click to vote
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hyp...
142
click to vote
ICIP
2007
IEEE
16 years 13 days ago
2007
IEEE
Online target tracking requires to solve two problems: data association and online dynamic estimation. Usually, association effectiveness is based on prior information and observa...
161
click to vote
EMMCVPR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...