메뉴 건너뛰기




Volumn 25, Issue 2, 2008, Pages 128-131

Lecture notes: Locality-sensitive hashing for finding nearest neighbors

Author keywords

[No Author keywords available]

Indexed keywords


EID: 85032771294     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2007.914237     Document Type: Note
Times cited : (333)

References (8)
  • 1
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • J. Bentley, "Multidimensional binary search trees used for associative searching," Commun. ACM, vol. 18, pp. 509-517, 1975.
    • (1975) Commun. ACM , vol.18 , pp. 509-517
    • Bentley, J.1
  • 2
    • 34547503156 scopus 로고    scopus 로고
    • Fast recognition of remixed music audio
    • pp. IV-1425-1428
    • M. Casey and M. Slaney, "Fast recognition of remixed music audio," in Proc. IEEE ICASSP, 2007, pp. IV-1425-1428.
    • (2007) Proc. IEEE ICASSP
    • Casey, M.1    Slaney, M.2
  • 3
    • 41949138440 scopus 로고    scopus 로고
    • 2LSH 0.1 User Manual
    • Jun, Online, Available
    • 2LSH 0.1 User Manual," Jun. 2005. [Online]. Available: http://web.mit.edu/andoni/www/LSH
    • (2005)
    • Andoni, A.1    Indyk, P.2
  • 6
    • 0010362121 scopus 로고    scopus 로고
    • Syntactic clustering of the Web
    • A. Broder, S. Glassman, M. Manasse, and G. Zweig, "Syntactic clustering of the Web," in Proc. WWW, Santa Clara, 1997, pp. 1157-1166.
    • (1997) , pp. 1157-1166
    • Broder, A.1    Glassman, S.2    Manasse, M.3    Zweig, G.4


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