189 search results - page 4 / 38 » From Linear Relaxations to Global Constraint Propagation |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
DISOPT
2008
13 years 8 months ago
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
COR
2006
13 years 8 months ago
2006
This paper presents a new generic filtering algorithm which simultaneously considers n conjunctions of constraints as well as those constraints mentioning some variables Yk of the...
CONSTRAINTS
2010
13 years 6 months ago
2010
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...