Functional monitoring without monotonicity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 95-106

  Arackaparambil, Chrisil ^a   Brody, Joshua ^a   Chakrabarti, Amit ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

Communication complexity; Data streams; Distributed algorithms; Sensor networks

Indexed keywords

COMMUNICATION COMPLEXITY; COMMUNICATION COST; DATA STREAMS; DISTRIBUTED ALGORITHMS; DISTRIBUTED MONITORING; DISTRIBUTED SYSTEMS; ENTROPY FUNCTION; FUNDAMENTAL PROBLEM; LOWER BOUNDS; MOMENT FUNCTIONS; MONITORING PROTOCOL; MONOTONE FUNCTIONS; MONOTONICITY; NON-MONOTONICITY; NON-TRIVIAL ALGORITHMS; SHANNON ENTROPY; SINGLE OUTPUT; TSALLIS ENTROPIES; UPPER AND LOWER BOUNDS;

COMMUNICATION; CONTROL THEORY; DATA COMMUNICATION SYSTEMS; ENTROPY; LINGUISTICS; MONITORING; PARALLEL ALGORITHMS; TRANSLATION (LANGUAGES);

SENSOR NETWORKS;

EID: 70449100958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_10     Document Type: Conference Paper

References (17)

1. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137-147 (1999);
2. Preliminary version In: Proc. 28th Annu. ACM Symp. Theory Comput., pp. 20-29 (1996)
3. Babcock, B., Olston, C.: Distributed top-k monitoring. In: Proc. Annual ACM SIGMOD Conference, pp. 28-39 (2003)
4. Bhuvanagiri, L., Ganguly, S.: Estimating entropy over data streams. In: Proc. 14th Annual European Symposium on Algorithms, pp. 148-159 (2006)
5. Cormode, G., Muthukrishnan, S., Yi, K.: Algorithms for distributed functional monitoring. In: Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1076-1085 (2008)
6. Cormode, G., Muthukrishnan, S., Zhuang, W.: What's different: Distributed, continuous monitoring of duplicate-resilient aggregates on data streams. In: Proc. 22nd International Conference on Data Engineering, p. 57 (2006)
7. Das, A., Ganguly, S., Garofalakis, M.N., Rastogi, R.: Distributed set expression cardinality estimation. In: Proc. 30th International Conference on Very Large Data Bases, pp. 312-323 (2004)
8. Estrin, D., Govindan, R., Heidemann, J.S., Kumar, S.: Next century challenges: Scalable coordination in sensor networks. In: MOBICOM, pp. 263-270 (1999)
9. Harvey, N.J.A., Nelson, J., Onak, K.: Sketching and streaming entropy via approximation theory. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 489-498 (2008)
10. Muthukrishnan, S.: Data streams: Algorithms and applications. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, p. 413 (2003)
11. Muthukrishnan, S.: Some algorithmic problems and results in compressed sensing. In: Proc. 44th Annual Allerton Conference (2006)
12. Newman, I.: Private vs. common random bits in communication complexity. Information Processing Letters 39(2), 67-71 (1991)
13. Sharfman, I., Schuster, A., Keren, D.: A geometric approach to monitoring threshold functions over distributed data streams. ACM Trans. Database Syst. 32(4) (2007)
14. Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Inf. Theory 19(4), 471-480 (1973)
15. Tsallis, C.: Possible generalization of Boltzmann-Gibbs statistics. J. Stat. Phys. 52, 479-487 (1988)
16. Woodruff, D.P.: Efficient and Private Distance Approximation in the Communication and Streaming Models. PhD thesis, MIT (2007)
17. Yi, K., Zhang, Q.: Multi-dimensional online tracking. In: Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1098-1107 (2009)