暂无分享,去创建一个
[1] Piotr Indyk,et al. Declaring independence via the sketching of sketches , 2008, SODA '08.
[2] Funda Ergün,et al. On distance to monotonicity and longest increasing subsequence of a data stream , 2008, SODA '08.
[3] Sudipto Guha,et al. Sketching information divergences , 2007, Machine Learning.
[4] Charu C. Aggarwal,et al. Data Streams - Models and Algorithms , 2014, Advances in Database Systems.
[5] Anna Gál,et al. Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[6] Noga Alon,et al. Testing k-wise and almost k-wise independence , 2007, STOC '07.
[7] David P. Woodruff,et al. The communication and streaming complexity of computing the longest common and increasing subsequences , 2007, SODA '07.
[8] Divesh Srivastava,et al. Space- and time-efficient deterministic algorithms for biased quantiles over data streams , 2006, PODS '06.
[9] Piotr Indyk,et al. Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.
[10] Ravi Kannan,et al. The space complexity of pass-efficient algorithms for clustering , 2006, SODA '06.
[11] Sumit Ganguly,et al. Simpler algorithm for estimating frequency moments of data streams , 2006, SODA '06.
[12] Rocco A. Servedio,et al. Testing monotone high-dimensional distributions , 2005, STOC '05.
[13] David P. Woodruff,et al. Optimal approximations of the frequency moments of data streams , 2005, STOC '05.
[14] Joan Feigenbaum,et al. Graph distances in the streaming model: the value of space , 2005, SODA '05.
[15] Gurmeet Singh Manku,et al. Approximate counts and quantiles over sliding windows , 2004, PODS.
[16] Ronitt Rubinfeld,et al. Sublinear algorithms for testing monotone and unimodal distributions , 2004, STOC '04.
[17] Ravi Kumar,et al. An improved data stream algorithm for frequency moments , 2004, SODA '04.
[18] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[19] Rina Panigrahy,et al. Better streaming algorithms for clustering problems , 2003, STOC '03.
[20] Noga Alon,et al. Almost k-wise independence versus k-wise independence , 2003, Information Processing Letters.
[21] Ziv Bar-Yossef,et al. An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[22] Piotr Indyk,et al. Comparing Data Streams Using Hamming Norms (How to Zero In) , 2002, VLDB.
[23] Jennifer Widom,et al. Models and issues in data stream systems , 2002, PODS.
[24] Ziv Bar-Yossef,et al. Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.
[25] Ronitt Rubinfeld,et al. Testing random variables for independence and identity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[26] Rajeev Motwani,et al. Incremental clustering and dynamic information retrieval , 1997, STOC '97.
[27] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[28] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.