57 search results - page 12 / 12 » Approximating Sparsest Cut in Graphs of Bounded Treewidth |
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
110
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...