CORR

2011

Springer

13 years 2 months ago
2011

Springer

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...

COMGEO

2011

ACM

13 years 2 months ago
2011

ACM

In this note, we show that the size of the perimeter of (α, β)-covered objects is a linear function of the diameter. Speciﬁcally, for an (α, β)-covered object O, per(O) ≤ c...

ECCC

1998

13 years 7 months ago
1998

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 ...

CORR

2006

Springer

13 years 8 months ago
2006

Springer

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...

FOCS

1994

IEEE

14 years 1 days ago
1994

IEEE

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 ...

IPPS

1999

IEEE

14 years 6 days ago
1999

IEEE

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...

EUROCRYPT

2004

Springer

14 years 1 months ago
2004

Springer

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...

ADHOCNOW

2004

Springer

14 years 1 months ago
2004

Springer

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...

FOCS

2005

IEEE

14 years 1 months ago
2005

IEEE

We present a polynomial time algorithm based on semideﬁnite programming that, given a unique game of value 1 − O(1/ log n), satisﬁes a constant fraction of constraints, wher...

STOC

2003

ACM

14 years 8 months ago
2003

ACM

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...