1389 search results - page 89 / 278 » Improved Approximation Algorithms for Label Cover Problems |
293
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
160
Voted
ML
2000
ACM
15 years 4 months ago
2000
ACM
This paper shows that the accuracy of learned text classifiers can be improved by augmenting a small number of labeled training documents with a large pool of unlabeled documents. ...
131
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
137
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
134
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a framework for active learning in the multiple-instance (MI) setting. In an MI learning problem, instances are naturally organized into bags and it is the bags, instea...