Sciweavers

Share
CORR
2011
Springer
188views Education» more  CORR 2011»
8 years 6 months ago
Robust Matrix Completion with Corrupted Columns
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
Yudong Chen, Huan Xu, Constantine Caramanis, Sujay...
COMGEO
2011
ACM
8 years 6 months ago
A note on the perimeter of fat objects
In this note, we show that the size of the perimeter of (α, β)-covered objects is a linear function of the diameter. Specifically, for an (α, β)-covered object O, per(O) ≤ c...
Prosenjit Bose, Otfried Cheong, Vida Dujmovic
ECCC
1998
80views more  ECCC 1998»
8 years 11 months ago
Extracting All the Randomness from a Weakly Random Source
In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The rst extracts any constant fraction ...
Salil P. Vadhan
CORR
2006
Springer
127views Education» more  CORR 2006»
8 years 11 months ago
Guessing Facets: Polytope Structure and Improved LP Decoder
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...
Alexandros G. Dimakis, Martin J. Wainwright
FOCS
1994
IEEE
9 years 3 months ago
Expander Codes
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Michael Sipser, Daniel A. Spielman
IPPS
1999
IEEE
9 years 3 months ago
Fully-Scalable Fault-Tolerant Simulations for BSP and CGM
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The faults are deterministic (i...
Sung-Ryul Kim, Kunsoo Park
EUROCRYPT
2004
Springer
9 years 4 months ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
ADHOCNOW
2004
Springer
9 years 4 months ago
Connectivity of Wireless Sensor Networks with Constant Density
We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such t...
Sarah Carruthers, Valerie King
FOCS
2005
IEEE
9 years 4 months ago
Approximation Algorithms for Unique Games
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
Luca Trevisan
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
9 years 11 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
books