Working Group on Streaming Data Analysis and Mining Home Page.
This material is based upon work supported by the National Science Foundation under Grant No. 0100921
====================== Monday, March 24, 2003 ====================== 8:00 - 8:50 Breakfast and registration 8:50 - 9:00 Opening remarks Fred Roberts, Director of DIMACS 9:00 - 9:30 Spectral Bloom Filters Yossi Matias, Tel Aviv University 9:45 - 10:15 Efficient pebbling for list traversal synopses Ely Porat, Bar Ilan University & Tel Aviv University 10:30 - 11:00 Frequency Estimation of Internet Packet Streams with Limited Space: Upper and Lower Bounds Yihua Tang, Carlton University 11:15 - 11:45 Maintaining Time-Decaying Stream Aggregates Martin J. Strauss, AT&T Labs--Research 12:00 - 2:00 LUNCH 2:00 - 2:30 Operator Scheduling for Memory Minimization in Stream Systems Brian Babcock, Stanford University 2:45 - 3:15 Extending the Streaming Model: Sorting and Streaming Networks Matthias Ruhl, MIT 3:15 - 4:00 BREAK 4:30 - 5:30 RECEPTION ======================= Tuesday, March 25, 2003 ======================= 8:30 - 9:00 Breakfast and registration 9:00 - 9:30 Distributed Streams Algorithms for Sliding Windows Phillip B. Gibbons, Intel Research Pittsburgh 9:45 - 10:15 Frequent Items in Sliding Windows Erik D. Demaine, MIT 10:30 - 11:00 Computing Diameter in the Streaming and Sliding-Window Models Jian Zhang, Yale University 11:30 - 1:00 LUNCH 1:00 - 1:30 Streaming Algorithms in Graphics Hardware Suresh Venkatasubramanian, AT&T Labs - Research 1:45 - 2:15 Stream Caching: A Mechanism to Support Multi-Record Computations within Stream Processing Architectures Nat Duca, Johns Hopkins University 2:30 - 3:00 Break 3:00 - 3:30 Streaming and Pseudorandom Generation Sudipto Guha, University of Pennsylvania 3:45 - 4:15 Inferring mixtures of Markov chains Tugkan Batu, University of Pennsylvania 4:30 - RUMP SESSION ========================= Wednesday, March 26, 2003 ========================= 8:30 - 9:00 Breakfast and registration 9:00 - 9:30 Distributed Mining and Monitoring Johannes Gehrke, Cornell University 9:45 - 10:15 Better Streaming Algorithms for Clustering Problems Moses Charikar, Princeton University 10:30 - 11:00 Locality-Sensitive Hashing Scheme Based on p-Stable Distributions Mayur Datar, Stanford University 11:15 - 11:45 On the Optimality of the Holistic Twig Join Algorithm Byron Choi, University of Pennsylvania 12:00 - 2:00 LUNCH Workshop adjourns