365 search results - page 44 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
104
click to vote
AIPS
2003
15 years 1 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
101
Voted
CCIA
2005
Springer
15 years 6 months ago
2005
Springer
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
184
Voted
MICCAI
2009
Springer
15 years 2 months ago
2009
Springer
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
114
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
121
click to vote
ACCV
2007
Springer
15 years 4 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...