554 search results - page 48 / 111 » Approximation algorithms and hardness results for labeled co... |
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
STOC
2010
ACM
14 years 16 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We propose a novel linear method for scale invariant figure ground separation in images and videos. Figure ground separation is treated as a superpixel labeling problem. We optim...
DAGSTUHL
2007
13 years 9 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...