1389 search results - page 127 / 278 » Improved Approximation Algorithms for Label Cover Problems |
114
click to vote
SAT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
129
click to vote
PRL
2008
15 years 3 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
122
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
124
click to vote
COLT
2005
Springer
15 years 8 months ago
2005
Springer
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
139
click to vote
AINA
2007
IEEE
15 years 9 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...