1389 search results - page 120 / 278 » Improved Approximation Algorithms for Label Cover Problems |
124
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
127
click to vote
NAACL
2007
15 years 4 months ago
2007
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
112
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
132
click to vote
IM
2007
15 years 3 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
128
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...