Declaring independence via the sketching of sketches

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 737-745

  McGregor, Andrew ^a   Indyk, Piotr ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DATASTREAM (CO); JOINT DISTRIBUTIONS; TECHNICAL CHALLENGES;

ALGORITHMS;

EID: 58449100249     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. N. ALON, A. ANDONI, T. KAUFMAN, K. MATULEF, R. RUBINFELD, AND N. XIE, Testing kwise and almost k-wise independence., in STOC, 2007, pp. 496-505.
2. N. ALON, Y. MATIAS, AND M. SZEGEDY, The space complexity of approximating the frequency moments, Journal of Computer and System Sciences, 58 (1999), pp. 137-147.
3. R. ANANTHAKRISHNA, A. DAS, J. GEHRKE, F. KORN, S. MUTHUKRISHNAN, AND D. SRIVASTAVA, Efficient approximation of correlated sums on data streams., IEEE Trans. Knowl. Data Eng., 15 (2003), pp. 569-572.
4. B. BABCOCK, S. BABU, M. DATAR, R. MOTWANI, AND J. WIDOM, Models and issues in data stream systems, ACM Symposium on Principles of Database Systems, (2002), pp. 1-16.
5. Z. BAR-YOSSEF, R. KUMAR, AND D. SIVAKU - MAR, Reductions in streaming algorithms, with an application to counting triangles in graphs, in ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 623-632.
6. T. BATU, L. FORTNOW, E. FISCHER, R. KUMAR, R. RUBINFELD, AND P. WHITE, Testing random variables for independence and identity., in FOCS, 2001, pp. 442-451.
7. L. BHUVANAGIRI, S. GANGULY, D. KESH, AND C. SAHA, Simpler algorithm for estimating frequency moments of data streams., in ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 708-713.
8. A. CHAKRABARTI, G. CORMODE, AND A. MC - GREGOR, A near-optimal algorithm for computing the entropy of a stream, in ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 328-335.
9. A. CHAKRABARTI, S. KHOT, AND X. SUN, Nearoptimal lower bounds on the multi-party communication complexity of set disjointness., in IEEE Conference on Computational Complexity, 2003, pp. 107-117.
10. K. L. CHANG and R. KANNAN, The space complexity of pass-efficient algorithms for clustering., in ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 1157-1166.
11. M. CHARIKAR, C. CHEKURI, T. FEDER, AND R. MOTWANI, Incremental clustering and dynamic information retrieval., SIAM J. Coinput., 33 (2004), pp. 1417-1440.
12. M. CHARIKAR, L. O'CALLAGHAN, AND R. PAN- IGRAHY, Better streaming algorithms for clustering problems., in ACM Symposium on Theory of Computing, 2003, pp. 30-39.
13. G. CORMODE, M. DATAR, P. INDYK, AND S. MUTHUKRISHNAN, Comparing data streams using hamming norms (How to zero in)., IEEE Trans. Knowl. Data Eng., 15 (2003), pp. 529-540.
14. G. CORMODE, F. KORN, S. MUTHUKRISHNAN, AND D. SRIVASTAVA, Space- and time-efficient deterministic algorithms for biased quantiles over data streams., in ACM Symposium on Principles of Database Systems, 2006, pp. 263-272.
15. T. M. COVER and J. A. THOMAS, Elements of Information Theory, John Wiley & Sons, 1991.
16. J. FEIGENBAUM, S. KANNAN, A. MCGREGOR, S. SURI, AND J. ZHANG, Graph distances in the streaming model: the value of space., in ACM- SIAM Symposium on Discrete Algorithms, 2005, pp. 745-754.
17. -. On graph problems in a semi-streaming model, Theoretical Computer Science, 348 (2005), pp. 207-216.
18. J. GEHRKE, F. KORN, AND D. SRIVASTAVA, On computing correlated aggregates over continual data streams., in SIGMOD Conference, 2001, pp. 13-24.
19. M. GREENWALD and S. KHANNA, Efficient online computation of quantile summaries., in ACM International Conference on Management of Data, 2001, pp. 58-66.
20. S. GUHA, P. INDYK, AND A. MCGREGOR, Sketching information divergences, in Conference on Learning Theory, 2007, pp. 424-438.
21. S. GUHA, N. KOUDAS, AND K. SHIM, Approximation and streaming algorithms for histogram construction problems, ACM Trans. Database Syst., 31 (2006), pp. 396-438.
22. S. GUHA and A. MCGREGOR, Lower bounds for quantile estimation in random-order and multipass streaming, in International Colloquium on Automata, Languages and Programming, 2007, pp. 704-715.
23. -. Space-efficient sampling, in AISTATS, 2007, pp. 169-176.
24. P. INDYK, Stable distributions, pseudorandom generators, embeddings, and data stream computation., J. ACM, 53 (2006), pp. 307-323.
25. P. INDYK and D. P. WOODRUFF, Optimal approximations of the frequency moments of data streams., in ACM Symposium on Theory of Computing, 2005, pp. 202-208.
26. T. S. JAYRAM, R. KUMAR, AND D. SIVAKUMAR, Simple lower bound on one-way Gap-Hamming., in www.cse.iitk.ac.in/users/sganguly/slides/ravikumar.pdf, 2007.
27. C. D. MANNING and H. SCHTZE, Foundations of Statistical Natural Language Processing, MIT Press, 1999.
28. S. MUTHUKRISHNAN, Data streams: Algorithms and applications. Now Publishers, (2006).
29. D. P. WOODRUFF, Optimal space lower bounds for all frequency moments., in ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 167-175.