287 search results - page 41 / 58 » An Algebraic Approach to Constraint Satisfaction Problems |
166
click to vote
ICDE
2010
IEEE
15 years 5 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
141
click to vote
SETN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
174
click to vote
IJCV
2006
15 years 5 months ago
2006
We present an algebraic geometric approach to 3-D motion estimation and segmentation of multiple rigid-body motions from noise-free point correspondences in two perspective views. ...
177
click to vote
ACCV
2007
Springer
15 years 9 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
173
click to vote
AAAI
2000
15 years 6 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...