메뉴 건너뛰기




Volumn , Issue , 2010, Pages 231-235

Online generation of Locality Sensitive Hash signatures

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ERRORS; CHARIKAR; COSINE SIMILARITY; DATA STREAM; LOCALITY SENSITIVE HASH; LOWER MEMORY REQUIREMENT; OFFLINE; ON-LINE GENERATION; STREAMING ALGORITHM; TEXT COLLECTION;

EID: 84859980553     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (41)

References (14)
  • 1
    • 0036040277 scopus 로고    scopus 로고
    • Similarity estimation techniques from rounding algorithms
    • Moses Charikar. 2002. Similarity estimation techniques from rounding algorithms. In Proceedings of STOC.
    • (2002) Proceedings of STOC
    • Charikar, M.1
  • 2
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In Proceedings of OSDI.
    • (2004) Proceedings of OSDI
    • Dean, J.1    Ghemawat, S.2
  • 3
    • 57349114053 scopus 로고    scopus 로고
    • Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
    • Wei Dong, Moses Charikar, and Kai Li. 2009. Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. In Proceedings of SIGIR.
    • (2009) Proceedings of SIGIR
    • Dong, W.1    Charikar, M.2    Li, K.3
  • 4
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • Michel X. Goemans and David P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM, 42:1115-1145.
    • (1995) JACM , vol.42 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 7
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of STOC.
    • (1998) Proceedings of STOC
    • Indyk, P.1    Motwani, R.2
  • 8
    • 80052683824 scopus 로고    scopus 로고
    • Streambased randomised language models for SMT
    • Abby Levenberg and Miles Osborne. 2009. Streambased Randomised Language Models for SMT. In Proceedings of EMNLP.
    • (2009) Proceedings of EMNLP
    • Levenberg, A.1    Osborne, M.2
  • 10
    • 80053272732 scopus 로고    scopus 로고
    • Streaming First Story Detection with application to Twitter
    • Sasa Petrovic, Miles Osborne, and Victor Lavrenko. 2010. Streaming First Story Detection with application to Twitter. In Proceedings of NAACL.
    • (2010) Proceedings of NAACL
    • Petrovic, S.1    Osborne, M.2    Lavrenko, V.3
  • 11
    • 36949016905 scopus 로고    scopus 로고
    • Randomized algorithms and NLP: Using locality sensitive hash functions for high speed noun clustering
    • Deepak Ravichandran, Patrick Pantel, and Eduard Hovy. 2005. Randomized Algorithms and NLP: Using Locality Sensitive Hash Functions for High Speed Noun Clustering. In Proceedings of ACL.
    • (2005) Proceedings of ACL
    • Ravichandran, D.1    Pantel, P.2    Hovy, E.3
  • 12
    • 78751680714 scopus 로고    scopus 로고
    • Succinct approximate counting of skewed data
    • David Talbot. 2009. Succinct approximate counting of skewed data. In Proceedings of IJCAI.
    • (2009) Proceedings of IJCAI
    • Talbot, D.1
  • 13
    • 78751689929 scopus 로고    scopus 로고
    • Probabilistic counting with randomized storage
    • Benjamin Van Durme and Ashwin Lall. 2009a. Probabilistic Counting with Randomized Storage. In Proceedings of IJCAI.
    • (2009) Proceedings of IJCAI
    • Van Durme, B.1    Lall, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.