暂无分享,去创建一个
[1] Srikanta Tirthapura,et al. Estimating simple functions on the union of data streams , 2001, SPAA '01.
[2] Sumit Ganguly,et al. Practical Algorithms for Tracking Database Join Sizes , 2005, FSTTCS.
[3] David P. Woodruff,et al. On the exact space complexity of sketching and streaming small norms , 2010, SODA '10.
[4] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..
[5] Moses Charikar,et al. Finding frequent items in data streams , 2002, Theor. Comput. Sci..
[6] Graham Cormode,et al. On Estimating Frequency Moments of Data Streams , 2007, APPROX-RANDOM.
[7] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[8] Aravind Srinivasan,et al. Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.
[9] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[10] Luca Trevisan,et al. Counting Distinct Elements in a Data Stream , 2002, RANDOM.
[11] Piotr Indyk,et al. Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.
[12] Ping Li,et al. Estimators and tail bounds for dimension reduction in lα (0 < α ≤ 2) using stable random projections , 2008, SODA '08.
[13] David P. Woodruff. Optimal space lower bounds for all frequency moments , 2004, SODA '04.