107 search results - page 17 / 22 » Near-optimal algorithms for unique games |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
WIOPT
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
VMV
2003
13 years 8 months ago
2003
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...
ICALP
2010
Springer
14 years 9 days ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...