350 search results - page 9 / 70 » Approximation Algorithms for Unique Games |
STOC
2010
ACM
13 years 11 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper we describe an approach that uses a combination of visual and audio features to cluster shots belonging to the same person together in video programs. We use color h...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
AAAI
2010
13 years 7 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...