717 search results - page 116 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
137
click to vote
MICCAI
2009
Springer
14 years 11 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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
WCNC
2010
IEEE
14 years 8 months ago
2010
IEEE
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...