CS 49/149
Data Stream Algorithms
Schedule of Class Presentations

Fall 2011

Tue, Nov 29

1. CR-Precis: A Deterministic Summary Structure for Update Data Streams.   [Yilong + Zhipeng]
2. Estimating Rarity and Similarity over Data Stream Windows.   [Chen + Vijay]
3. Estimating the Sortedness of a Data Stream.   [Zhiyu + Zhong]
4. Space-Efficient Online Computation of Quantile Summaries.   [Shahrzad + Shrirang]

Mon, Dec 5

5. The Shifting Sands Algorithm.   [Thomas + Yu-Han]
6. Recognizing Well-Parenthesized Expressions in the Streaming Model.   [Andrew + Huiting]
7. Estimating PageRank on Graph Streams.   [Cole + Fabio]

General Instructions

• Each presentation should be for 20 minutes.
• Divide your time so that each person speaks for 10 minutes.
• Use good slides, with helpful pictures. Don't just put lots of text and formulas on the slides.
• Show at least one algorithm in pseudocode form. Don't just lift pseudocode right out of the paper unless it's very clear pseudocode. Instead, simplify the paper's presentation (possibly losing some accuracy and details).
• As a rule of thumb, a 20-minute talk should have 10 to 12 slides.
• Practise your talk to ensure that you can finish within 20 minutes. This is very important!