8 search results - page 2 / 2 » Belief Propagation and LP Relaxation for Weighted Matching i... |
ICML
2006
IEEE
14 years 5 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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...