Sciweavers

Share
FOCS
2006
IEEE
9 years 4 months ago
Concurrent Non-Malleable Zero Knowledge
Boaz Barak, Manoj Prabhakaran, Amit Sahai
FOCS
2006
IEEE
9 years 4 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
FOCS
2006
IEEE
9 years 4 months ago
On the Optimality of the Dimensionality Reduction Method
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
FOCS
2006
IEEE
9 years 4 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
FOCS
2006
IEEE
9 years 4 months ago
On the Impact of Combinatorial Structure on Congestion Games
Heiner Ackermann, Heiko Röglin, Berthold V&ou...
FOCS
2006
IEEE
9 years 4 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
FOCS
2006
IEEE
9 years 4 months ago
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
We investigate variants of Lloyd’s heuristic for clustering high dimensional data in an attempt to explain its popular
Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulma...
FOCS
2006
IEEE
9 years 4 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
FOCS
2006
IEEE
9 years 4 months ago
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
Christian Borgs, Jennifer T. Chayes, Elchanan Moss...
books