13376 search results - page 221 / 2676 » Problem Solving with |
131
Voted
AICOM
2004
15 years 3 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
94
Voted
ICASSP
2007
IEEE
15 years 9 months ago
2007
IEEE
A method to establish correspondences between regions belonging to independent segmentations of multiple views of a scene is presented. The trade-off between color similarity and ...
146
Voted
SIGAL
1990
15 years 7 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
244
Voted
EMMCVPR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
140
Voted
CADE
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...