120 search results - page 6 / 24 » Spectral Algorithms for Unique Games |
JSCIC
2006
13 years 7 months ago
2006
This paper deals with the identification of a zone permitting fluid to leak out of a drain. Using the analogy with crack identification by boundary measurements, we give uniqueness...
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
An unsupervised seabed segmentation algorithm for synthetic aperture sonar (SAS) imagery is proposed. Each 2 m ? 2 m area of seabed is treated as a unique data point. A set of fea...
COCO
2005
Springer
14 years 27 days ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...