32 search results - page 1 / 7 » Tight Local Approximation Results for Max-Min Linear Program... |
ALGOSENSORS
2008
Springer
13 years 6 months ago
2008
Springer
PAMI
2007
13 years 3 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
SIAMCOMP
2010
13 years 2 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
FSTTCS
2001
Springer
13 years 8 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
CVPR
2012
IEEE
11 years 6 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...