FOCS 1995 | Sciweavers

88

FOCS
1995
IEEE

86views Theoretical Computer Science» more FOCS 1995»

15 years 2 months ago

Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...

Peter Auer, Manfred K. Warmuth

claim paper

Read More »

75

Voted

FOCS
1995
IEEE

87views Theoretical Computer Science» more FOCS 1995»

Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)

15 years 2 months ago

Download www.tau.ac.il

d Abstract) Noga Alon ∗ Jeﬀ Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...

Noga Alon, Jeff Edmonds, Michael Luby

claim paper

Read More »

61

click to vote

FOCS
1995
IEEE

63views Theoretical Computer Science» more FOCS 1995»

Improved Algorithms and Analysis for Secretary Problems and Generalizations

15 years 2 months ago