Sciweavers

Share
32 search results - page 1 / 7
» Tight Local Approximation Results for Max-Min Linear Program...
Sort
View
ALGOSENSORS
2008
Springer
11 years 3 months ago
Tight Local Approximation Results for Max-Min Linear Programs
Patrik Floréen, Marja Hassinen, Petteri Kas...
PAMI
2007
176views more  PAMI 2007»
11 years 24 days ago
Approximate Labeling via Graph Cuts Based on Linear Programming
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 ...
Nikos Komodakis, Georgios Tziritas
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
10 years 11 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
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...
Kousha Etessami, Mihalis Yannakakis
FSTTCS
2001
Springer
11 years 5 months ago
Semidefinite Programming Based Approximation Algorithms
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...
Uri Zwick
CVPR
2012
IEEE
9 years 3 months ago
What is optimized in tight convex relaxations for multi-label problems?
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...
Christopher Zach, Christian Hane, Marc Pollefeys
books