Material
Section 1:
- Data Streams: Algorithms and Applications S. Muthukrishnan
- Optimal Tracking of Distributed Heavy Hitters and Quantiles Ke Yi, Qin Zhang
- Annotations in Data Streams Amit Chakrabarti, Graham Cormode, Andrew McGregor
- Counting Distinct Elements in a Data Stream Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan
- Finding Graph Matchings in Data Streams Andrew McGregor
- Estimating the Sortedness of a Data Stream Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
- On Distance to Monotonicity and Longest Increasing Subsequence of a Data Stream Funda Ergun, Hossein Jowhari
- Efficient Sketches for Earth-Mover Distance, with Applications Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David Woodruff
- The Space Complexity of Approximating the Frequency Moments Noga Alon, Yossi Matias, Mario Szegedy
- Optimal Approximations of the Frequency Moments of Data Streams Piotr Indyk, David Woodruff
- Algorithms for Distributed Functional Monitoring Graham Cormode, S. Muthukrishnan, Ke Yi
- An information statistics approach to data stream and communication complexity Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar
Section 2:
- Graph-Based Anomaly Detection Caleb C. Noble, Diane J. Cook
- Dynamic Network Evolution: Models, Clustering, Anomaly Detection Cemal Cagatay Bilgin, Bülent Yener
- Proximity-Based Anomaly Detection using Sparse Structure Learning Tsuyoshi Idè, Aurelie C. Lozano Naoki, Abe Yan Liu
- Anomaly Detection in Large Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos
- Web Graph Similarity for Anomaly Detection Panagiotis Papadimitriou, Ali Dasdan, Hector Garcia-Molina
- Rumors in a Network: Who's the Culprit? Devavrat Shah, Tauhid Zaman
- Finding Rumor Sources on Random Graphs Devavrat Shah, Tauhid Zaman
- Scan Statistics for the Online Detection of Locally Anomalous Subgraphs Joshua Neil, Curtis B. Storlie, Curtis Hash, Alexander Brugh, Mike Fisk