#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Avrim Blum, Adam Tauman Kalai, Hal Wasserman
- STOC
- 2000

We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptographic and coding problems. Our algorithm runs in polynomial time for the case of parity functions that depend on only the first <i>O</i>(log <i>n</i> log log <i>n</i>) bits of input,… (More)

- Kinshuk Govil, Edwin Chan, Hal Wasserman
- MobiCom
- 1995

To take advantage of the full potential of ubiquitous computing, we will need systems which minimize powerconsumption. Weiser et al. and others have suggested that this may be accomplished by a CPU which dynamically changes speed and voltage, thereby saving energy by spreading run cycles into idle time. Here we continue this research, using a simulation to… (More)

- Amin Shokrollahi, Hal Wasserman
- IEEE Trans. Information Theory
- 1999

We describe a slightly sub-exponential time algorithm for learning parity functions in the presence of random classiication noise. By applying this algorithm to the restricted case of parity functions that depend on only the rst O(log n loglog n) bits of input, we achieve the rst known instance of a polynomial-time noise-tolerant learning algorithm for a… (More)

- Hal Wasserman, Manuel Blum
- J. ACM
- 1997

We review the field of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and enhanced reliability. We consider how to modify traditional checking methodologies to make them more appropriate for use in real-time, real-number computer… (More)

- Manuel Blum, Hal Wasserman
- IEEE Trans. Computers
- 1996

- Amin Shokrollahi, Hal Wasserman
- STOC
- 1998

C?cneralizing the high-noise decoding methods of [I, 191 to the class of algebraic-geometric codes, we design the first polynomialtime algorithms to decode algebraic-geometric codes significantly beyond the conventional error-correction bound. Applying our results to codes obtained from curves with many rational points, we construct arbitrarily long,… (More)

- Manuel Blum, Hal Wasserman
- FOCS
- 1994

We reuaew the field of result-checking, dascussang simple checkers and self-correctors. We argue that such checkers could profitably be ancorporated an software as an aad to eficaent debuggang and relaable functaonalaty. We consader how to modafy tradataonal checkang methodologaes to make them more appropraate for use an real-tame, real-number computer… (More)

- Hal Wasserman
- 1997

- Hal Wasserman
- SODA
- 1998

Sudan and others have considered the problem of reconstructing a bounded-degree polynomial f : F” + F from n data-points, only t of which are guaranteed to be consistent with f. For t << n/2, the solution may not be unique; but it may be possible to find a small set of candidates for f. Here we extend this work, proving results including the following: Pick… (More)