메뉴 건너뛰기




Volumn 2, Issue , 2014, Pages 495-500

Two-stage hashing for fast document retrieval

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; ITERATIVE METHODS; NEAREST NEIGHBOR SEARCH;

EID: 84906933106     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p14-2081     Document Type: Conference Paper
Times cited : (26)

References (21)
  • 1
    • 37549058056 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • A. Andoni and P. Indyk. 2008. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM, 51(1):117-122.
    • (2008) Communications of the ACM , vol.51 , Issue.1 , pp. 117-122
    • Andoni, A.1    Indyk, P.2
  • 4
    • 0037844312 scopus 로고    scopus 로고
    • Similarity estimation techniques from rounding algorithms
    • M. Charikar. 2002. Similarity estimation techniques from rounding algorithms. In Proc. STOC.
    • (2002) Proc. STOC
    • Charikar, M.1
  • 8
    • 85086728910 scopus 로고    scopus 로고
    • Unsupervised mining of lexical variants from noisy text
    • S. Gouws, D. Hovy, and D. Metzler. 2011. Unsupervised mining of lexical variants from noisy text. In Proc. EMNLP.
    • (2011) Proc. EMNLP
    • Gouws, S.1    Hovy, D.2    Metzler, D.3
  • 15
    • 80053272732 scopus 로고    scopus 로고
    • Streaming first story detection with application to twitter
    • S. Petrovic, M. Osborne, and V. Lavrenko. 2010. Streaming first story detection with application to twitter. In Proc. HLT-NAACL.
    • (2010) Proc. HLT-NAACL
    • Petrovic, S.1    Osborne, M.2    Lavrenko, V.3
  • 16
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • M. F. Porter. 1980. An algorithm for suffix stripping. Program, 14(3):130-137.
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, M.F.1
  • 17
    • 36949016905 scopus 로고    scopus 로고
    • Randomized algorithms and nlp: Using locality sensitive hash functions for high speed noun clustering
    • D. Ravichandran, P. Pantel, and E. H. Hovy. 2005. Randomized algorithms and nlp: Using locality sensitive hash functions for high speed noun clustering. In Proc. ACL.
    • (2005) Proc. ACL
    • Ravichandran, D.1    Pantel, P.2    Hovy, E.H.3
  • 19
    • 51949119257 scopus 로고    scopus 로고
    • Small codes and large image databases for recognition
    • A. Torralba, R. Fergus, and Y. Weiss. 2008b. Small codes and large image databases for recognition. In Proc. CVPR.
    • (2008) Proc. CVPR
    • Torralba, A.1    Fergus, R.2    Weiss, Y.3
  • 20
    • 80053277282 scopus 로고    scopus 로고
    • Hashing-based approaches to spelling correction of personal names
    • R. Udupa and S. Kumar. 2010. Hashing-based approaches to spelling correction of personal names. In Proc. EMNLP.
    • (2010) Proc. EMNLP
    • Udupa, R.1    Kumar, S.2


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