Sciweavers

120 search results - page 4 / 24
» Spectral Algorithms for Unique Games
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 11 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 9 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
11 years 9 months ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright
TSP
2008
116views more  TSP 2008»
13 years 7 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
ICASSP
2011
IEEE
12 years 11 months ago
Sparse spectral factorization: Unicity and reconstruction algorithms
Spectral factorization is a classical tool in signal processing and communications. It also plays a critical role in X-ray crystallography, in the context of phase retrieval. In t...
Yue M. Lu, Martin Vetterli