Faculty:
Students:
Alumi:
The talk is open for anyone from outside, despite the degree of your seriousness.
Normally each talk lasts about one hour. The default meeting place is Coover 1219.
| 2008 | |||||
| Date | Time | Presenter | Paper | Slides | Place |
| 1/31 | 5pm | Bojian | R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules", VLDB 1994 | slides | |
| 2/7 | 10am | Bibudh | J. Han, J. Pei, Y. Yin, R. Mao: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Min. Knowl. Discov. 8(1): 53-87 (2004) | slides | |
| 2/21 | 10am | Puvi |
R. Agrawal and R. Srikant, "Privacy-Preserving Data Mining", SIGMOD2000 |
||
| 2/28 | 10am | Puvi |
R. Agrawal and R. Srikant, "Privacy-Preserving Data Mining", SIGMOD2000 (continue) |
||
| 3/6 | 10am | Bojian | A. Evfimievski, R. Srikant, R. Agrawal, J. Gehrke, "Privacy Preserving Mining of Association Rules", SIGKDD2002 | ||
| 3/13 | 10am | Bojian | A. Evfimievski, R. Srikant, R. Agrawal, J. Gehrke, "Privacy Preserving Mining of Association Rules", SIGKDD2002 (Continue) | ||
| 4/3 | 10am | Bibudh | Guha, Meyerson, Mishra, Motwani, O'Callaghan,"Clustering Data Streams: Theory and Practice", TKDE 2003 | ||
| 4/10 | 10am | Bibudh | Guha, Meyerson, Mishra, Motwani, O'Callaghan,"Clustering Data Streams: Theory and Practice", TKDE 2003 (continue) | slides | |
| 9/24 | 10:30am | Bibudh | G. S. Manku and R. Motwani.
Approximate Frequency Counts over Streaming Data VLDB 2002 |
slides | |
| 10/1 | 10:30 | Bojian | Graham Cormode and S. Muthukrishnan, "An improved data stream summary: the count-min sketch and its applications", J. of Algorithms, V55(1), PP58-75, 2005/04 | ppt, pdf | |
| 10/8 | |||||
| 10/15 | 10:30 | Bojian | Theorem proofs in: Graham Cormode and S. Muthukrishnan, "An improved data stream summary: the count-min sketch and its applications", J. of Algorithms, V55(1), PP58-75, 2005/04 | black board | |
| 2007 | |||||
| Date | Time | Presenter | Paper | Slides | Place |
| 04/03 | Bojian | L. K. Lee, H. F. Ting, "A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows", PODS 2006 | |||
| 04/12 | Puvi | A. Lall, V. Sekar, M. Ogihara, J. Xu, H. Zhang, "Data Streaming Algorithms for Estimating Entropy of Network Traffic", SIGMETRICS/Performance 2006 | |||
| 04/19 | Puvi | A. Chakrabarti, G. Cormode, A. McGregor, "A Near-Optimal Algorithm for Computing the Entropy of a Stream", SODA 2007 | |||
| 04/26 | Bibudh | N. Shrivastava, C. Buragohain, D. Agrawal, S. Suri, "Medians and beyond: new aggregation techniques for sensor networks", SenSys 2004 | |||
| 05/17 | Bibudh |
A. Deshpande, C. Guestrin, W. Hong, S. Madden, "Exploiting Correlated Attributes in Acquisitional Query Processing", ICDE 2005 |
|||
| 05/22 | Bojian | 1. M. Greenwald, S. khanna,
"Space-Efficient Online Computation of Quantile Summaries", SIGMOD 2001 2. R. Ananthakrishna, A. Das, J. Gehrke, F. Korn, S. Muthukrishnan, D. Srivastava, "Efficient Approximation of Correlated Sums on Data Streams", IEEE TKDE 2003 |
slides | Coover 2222 | |
| 05/25 | Bojian | J. Gehrke, F. Korn, D. Srivastava, "On computing correlated aggregates over continual data streams", SIGMOD 2001 | slides | Coover 2222 | |
| 05/29 | 11:30 AM | Bojian | N. Alon, P. B. Gibbons, Y. Matias, M. Szegedy, "Tracking join and self-join sizes in limited storage", PODS 1999 | slides | Coover Sproul |
| 05/31 | 11:00 AM | Bojian | N. Alon, P. B. Gibbons, Y. Matias, M. Szegedy, "Tracking join and self-join sizes in limited storage", PODS 1999 (continued) | slides | Coover 3138 |
| 06/18 | 10:00 AM | Bibudh | CarTel Project at MIT:
http://cartel.csail.mit.edu/ B. Hull, V. Bychkovsky, K. Chen, M. Goraczko, A. Miu, E. Shih, Y. Zhang, H. Balakrishnan, and S. Madden, "CarTel: A Distributed Mobile Sensor Computing System", SenSys, 2006. |
Coover 2222 | |
| 06/20 | 11:00 AM | Bojian | G. Cormode, F. Korn, S. Muthukrishnan, D. Srivastava, "Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data", SIGMOD 2004 | slides | Sproul Coover |
| 06/22 | 11:00 AM | Puvi | Y. Zhang, S. Singh, S. Sen, N. Duffield, C. Lund, "Online Identification of Hierarchical Heavy Hitters: Algorithms, Evaluation, and Applications", IMC 2004 | ||
| 10/17 | 5 pm | Bojian |
T.S. Jayram, S. Kale, E. Vee, "Efficient aggregation algorithms for probabilistic data", SODA 2007 |
slides | Coover 3138 |
| 10/24 | 5pm | Puvi |
"Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks", by Sukun Kim, Rodigo Fonseca, Prabal Dutta, Arsalan Tavakoli, David Culler, Philip Levis, Scott Shenker, Ion Stoica, SenSys 2007 |
slides | Coover 3138 |
| 10/31 | 5pm | Bibudh | Boulat A. Bash, John W. Byers, Jeffrey Considine, "Approximately uniform random sampling in sensor networks", 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 | slides | Coover 3138 |
| 11/7 | 5pm | Bojian | Minos N. Garofalakis, Joseph M. Hellerstein, Petros Maniatis, "Proof Sketches: Verifiable In-Network Aggregation", ICDE 2007 | slides | Coover 3138 |
| 11/14 | 5pm | Puvi | C. Sengul, R. Kravets, "Heuristic Approaches to Energy-Efficient Network Design Problem", ICDCS 2007 | slides | Coover 3138 |
| 11/28 | 5pm | Bibudh | D. Callaway, J. Hopcroft, J. Kleinberg, M. Newman, S. Strogatz. "Are randomly grown graphs really random?" Physical Review E 64, 041902 (2001). | slides | Coover3138 |
| 12/5 | 5pm | Bojian | Rakesh Agrawal, Tomasz Imielinski, Arun Swami, "Mining Association Rules between Sets of Items in Large Databases", SIGMOD 1993 | slides | Coover 3138 |