189 search results - page 2 / 38 » From Linear Relaxations to Global Constraint Propagation |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
CVPR
2006
IEEE
14 years 7 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...
ECAI
2010
Springer
13 years 3 months ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
CPAIOR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
CP
2006
Springer
13 years 8 months ago
2006
Springer
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...