暂无分享,去创建一个
[1] Mahesh Viswanathan,et al. An Approximate L1-Difference Algorithm for Massive Data Streams , 2002, SIAM J. Comput..
[2] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[3] Srikanta Tirthapura,et al. Estimating simple functions on the union of data streams , 2001, SPAA '01.
[4] David P. Woodruff,et al. On the exact space complexity of sketching and streaming small norms , 2010, SODA '10.
[5] Ping Li,et al. Estimators and tail bounds for dimension reduction in lα (0 < α ≤ 2) using stable random projections , 2008, SODA '08.
[6] Subhash Khot,et al. Near-optimal lower bounds on the multi-party communication complexity of set disjointness , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[7] Luca Trevisan,et al. Counting Distinct Elements in a Data Stream , 2002, RANDOM.
[8] 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..
[9] Piotr Indyk,et al. Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.
[10] Michael E. Saks,et al. Space lower bounds for distance approximation in the data stream model , 2002, STOC '02.
[11] Piotr Indyk,et al. Fast mining of massive tabular data via approximate distance computations , 2002, Proceedings 18th International Conference on Data Engineering.
[12] David P. Woodruff. Optimal space lower bounds for all frequency moments , 2004, SODA '04.
[13] Sudipto Guha,et al. Fast, small-space algorithms for approximate histogram maintenance , 2002, STOC '02.
[14] Graham Cormode,et al. On Estimating Frequency Moments of Data Streams , 2007, APPROX-RANDOM.
[15] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..
[16] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..