365 search results - page 40 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
116
Voted
KI
2002
Springer
15 years 3 days ago
2002
Springer
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
112
Voted
ICDE
2010
IEEE
15 years 19 days 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...
91
Voted
SETN
2004
Springer
15 years 5 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...
91
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper presents a novel approach for landmarkbased shape deformation, in which fitting error and shape difference are formulated into a support vector machine (SVM) regression...
127
Voted
AAAI
2000
15 years 1 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 ...