![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Graham Cormode Graham Cormode, Minos N. Garofalakis , Dimitris Sacharidis : Fast Approximate Wavelet Tracking on Streams. EDBT 2006 : 4-22 Graham Cormode, S. Muthukrishnan , Wei Zhuang : What's Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams. ICDE 2006 : 57 Graham Cormode, Flip Korn , S. Muthukrishnan , Divesh Srivastava : Effective Computation of Biased Quantiles over Data Streams. ICDE 2005 : 20-31 Graham Cormode, S. Muthukrishnan : Space efficient mining of multigraph streams. PODS 2005 : 271-282 Graham Cormode, S. Muthukrishnan : Summarizing and Mining Skewed Data Streams. SDM 2005 Graham Cormode, Minos N. Garofalakis , S. Muthukrishnan , Rajeev Rastogi : Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles. SIGMOD Conference 2005 : 25-36 Graham Cormode, S. Muthukrishnan : Substring compression problems. SODA 2005 : 321-330 Graham Cormode, Minos N. Garofalakis : Sketching Streams Through the Net: Distributed Approximate Query Tracking. VLDB 2005 : 13-24 Graham Cormode, S. Muthukrishnan , Irina Rozenbaum : Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling. VLDB 2005 : 25-36 Graham Cormode, S. Muthukrishnan : What's hot and what's not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30 (1): 249-278 (2005) Graham Cormode, Minos N. Garofalakis : Efficient Strategies for Continuous Distributed Tracking Tasks. IEEE Data Eng. Bull. 28 (1): 33-39 (2005) Graham Cormode, S. Muthukrishnan : An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55 (1): 58-75 (2005) Graham Cormode, S. Muthukrishnan : What's New: Finding Significant Differences in Network Data Streams. INFOCOM 2004 Graham Cormode, S. Muthukrishnan : An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. LATIN 2004 : 29-38 Graham Cormode, Flip Korn , S. Muthukrishnan , Divesh Srivastava : Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. SIGMOD Conference 2004 : 155-166 Graham Cormode, Theodore Johnson , Flip Korn , S. Muthukrishnan , Oliver Spatscheck , Divesh Srivastava : Holistic UDAFs at streaming speeds. SIGMOD Conference 2004 : 35-46 Gultekin Özsoyoglu , Nevzat Hurkan Balkir , Z. Meral Özsoyoglu , Graham Cormode: On Automated Lesson Construction from Electronic Textbooks. IEEE Trans. Knowl. Data Eng. 16 (3): 317-331 (2004) Graham Cormode, S. Muthukrishnan : Estimating Dominance Norms of Multiple Data Streams. ESA 2003 : 148-160 Graham Cormode, S. Muthukrishnan : What's hot and what's not: tracking most frequent items dynamically. PODS 2003 : 296-306 Graham Cormode, Flip Korn , S. Muthukrishnan , Divesh Srivastava : Finding Hierarchical Heavy Hitters in Data Streams. VLDB 2003 : 464-475 Graham Cormode, Mayur Datar , Piotr Indyk , S. Muthukrishnan : Comparing Data Streams Using Hamming Norms (How to Zero In). IEEE Trans. Knowl. Data Eng. 15 (3): 529-540 (2003) Graham Cormode, Piotr Indyk , Nick Koudas , S. Muthukrishnan : Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002 : 605- Graham Cormode, S. Muthukrishnan : The string edit distance matching problem with moves. SODA 2002 : 667-676 Graham Cormode, Mayur Datar , Piotr Indyk , S. Muthukrishnan : Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002 : 335-345 Graham Cormode, S. Muthukrishnan , Süleyman Cenk Sahinalp : Permutation Editing and Matching via Embeddings. ICALP 2001 : 481-492 Gultekin Özsoyoglu , Nevzat Hurkan Balkir , Graham Cormode, Z. Meral Özsoyoglu : Electronic Books in Digital Libraries. ADL 2000 : 5-14 Graham Cormode, Mike Paterson , Süleyman Cenk Sahinalp , Uzi Vishkin : Communication complexity of document exchange. SODA 2000 : 197-206 1 [ 2 ] [ 11 ] 2 [ 4 ] [ 7 ] 3 [ 17 ] [ 20 ] [ 22 ] [ 27 ] 4 [ 4 ] [ 6 ] [ 7 ] 5 [ 12 ] 6 [ 8 ] [ 12 ] [ 13 ] [ 25 ] 7 [ 6 ] 8 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 18 ] [ 19 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] 9 [ 2 ] [ 11 ] 10 [ 2 ] [ 11 ] 11 [ 1 ] 12 [ 22 ] 13 [ 19 ] 14 [ 27 ] 15 [ 1 ] [ 3 ] 16 [ 12 ] 17 [ 8 ] [ 12 ] [ 13 ] [ 25 ] 18 [ 1 ] 19 [ 26 ] ![]() ©2006 Association for Computing Machinery |