120 search results - page 2 / 24 » Spectral Algorithms for Unique Games |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
CORR
2010
Springer
13 years 5 months ago
2010
Springer
DAGSTUHL
2007
13 years 6 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
TIT
2008
13 years 5 months ago
2008
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...