1389 search results - page 79 / 278 » Improved Approximation Algorithms for Label Cover Problems |
119
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
123
click to vote
WINE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
107
click to vote
ICML
2000
IEEE
16 years 3 months ago
2000
IEEE
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
123
click to vote
ISNN
2009
Springer
15 years 9 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
138
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...