15 search results - page 2 / 3 » Approximate Labeling via Graph Cuts Based on Linear Programm... |
SODA
2001
ACM
13 years 6 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
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...
EMMCVPR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...