1389 search results - page 93 / 278 » Improved Approximation Algorithms for Label Cover Problems |
130
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
125
click to vote
ICCS
2009
Springer
15 years 11 months ago
2009
Springer
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
268
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
142
click to vote
WAE
2000
15 years 6 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
134
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...