Sciweavers

287 search results - page 35 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
ICCV
2005
IEEE
14 years 1 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
CPAIOR
2006
Springer
13 years 9 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
SGAI
2007
Springer
14 years 1 months ago
Escaping Local Optima: Constraint Weights vs. Value Penalties
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
Muhammed Basharu, Inés Arana, Hatem Ahriz
ECCV
2006
Springer
14 years 9 months ago
Algebraic Methods for Direct and Feature Based Registration of Diffusion Tensor Images
Abstract. We present an algebraic solution to both direct and featurebased registration of diffusion tensor images under various local deformation models. In the direct case, we sh...
Alvina Goh, René Vidal
PPDP
2010
Springer
13 years 6 months ago
A declarative approach to robust weighted Max-SAT
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...
Miquel Bofill, Dídac Busquets, Mateu Villar...