Improved sketching of hamming distance with error correcting

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

Volumn 4580 LNCS, Issue , 2007, Pages 173-182

  Porat, Ely ^a   Lipsky, Ohad ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; PROBABILITY;

DATA STREAMS; FIXABLE SKETCHES;

HAMMING DISTANCE;

EID: 37849042296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_19     Document Type: Conference Paper

References (12)

1. Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: Approximating edit distance efficiently. In: FOCS, pp. 550-559. IEEE Computer Society Press, Los Alamitos (2004)
2. Bar-Yossef, Z., Jayram, T.S, Kumar, R., Sivakumar, D.: Manuscript (2003) [3] Batu, T., Ergün, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R., Sami, R.: A sublinear algorithm for weakly approximating edit distance. In: STOC, pp. 316-324. ACM, New York (2003)
3. Cormode, G., Datar, M., Indyk, P., Muthukrishnan, S.: Comparing data streams using hamming norms (how to zero in). IEEE Trans. Knowl. Data Eng. 15(3), 529-540 (2003)
4. Cormode, G., Paterson, M., Sahinalp, S.C., Vishkin, U.: Communication complexity of document exchange. In: SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 197-206. Society for Industrial and Applied Mathematics (2000)
5. Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 927-938. Springer, Heidelberg (2001)
6. Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: An approximate 11-difference algorithm for massive data streams. SIAM J. Comput (and in Proceedings of the 40th Annual Symposium on Foundations of Computer Science), 32(1) 131-151, (2002) Appeared in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 501-511 (1999)
7. Gilbert, A.C., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Fast, small-space algorithms for approximate histogram maintenance. In: STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 389-398. ACM Press, New York (2002)
8. Guha, S., Koudas, N., Shim, K.: Data-streams and histograms. In: STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 471-475. ACM Press, New York (2001) [10] Indyk, P.: Stable distributions, pseudorandom generators, embeddings and data stream computation. In: FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 189. IEEE Computer Society Press, Los Alamitos (2000)
9. Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457-474 (2000)
10. Muthukrishnan, S.: Data streams: algorithms and applications. In: SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 413-413, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (2003)
11. Starobinski, D., Trachtenberg, A., Agarwal, S.: Efficient pda synchronization. IEEE Trans. Mob. Comput. 2(1), 40-51 (2003)
12. Trachtenberg, A., Starobinski, D., Agarwal, S.: Fast pda synchronization using characteristic polynomial interpolation. In: INFOCOM (2002)