7150 search results - page 48 / 1430 » An Approximation Algorithm for Approximation Rank |
128
Voted
NIPS
1997
15 years 1 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
114
Voted
ISITA
2010
14 years 10 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
110
click to vote
SIGECOM
2003
ACM
15 years 5 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
115
click to vote
AAIM
2010
Springer
15 years 3 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
111
click to vote
DAM
1999
15 years 5 days ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...