STOC
2004
ACM
14 years 11 months ago
2004
ACM
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
STOC
2004
ACM
14 years 11 months ago
2004
ACM
STOC
2004
ACM
14 years 11 months ago
2004
ACM
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
STOC
2004
ACM
14 years 11 months ago
2004
ACM
STOC
2004
ACM
14 years 11 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...