144 search results - page 24 / 29 » Constraint Propagation in Graph Coloring |
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
NIPS
2004
13 years 8 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
DATE
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...