Sciweavers

22

FOCS
1995
IEEE

86views Theoretical Computer Science» more FOCS 1995»

Tracking the Best Disjunction

13 years 11 months ago

Tracking the Best Disjunction

Download users.soe.ucsc.edu

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 »

21

FOCS
1995
IEEE

87views Theoretical Computer Science» more FOCS 1995»

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

13 years 11 months ago

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

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 »

21

FOCS
1995
IEEE

63views Theoretical Computer Science» more FOCS 1995»

Improved Algorithms and Analysis for Secretary Problems and Generalizations

13 years 11 months ago

Improved Algorithms and Analysis for Secretary Problems and Generalizations

Download theory.stanford.edu

Miklós Ajtai, Nimrod Megiddo, Orli Waarts

claim paper

Read More »