1389 search results - page 36 / 278 » Improved Approximation Algorithms for Label Cover Problems |
104
click to vote
IPMI
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
90
Voted
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
78
Voted
IPL
2007
14 years 11 months ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
114
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...