365 search results - page 33 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
88
Voted
SGAI
2007
Springer
15 years 6 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
96
Voted
ISBI
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper we present a dynamic texture based motion segmentation approach to address the challenging problem of heart localization and segmentation in 4D Spatio-temporal cardi...
107
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
196
Voted
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
93
Voted
AAAI
2007
15 years 2 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...