108
click to vote
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
120
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We say an algorithm on n
93
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
110
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
106
click to vote
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our dista...
135
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...