메뉴 건너뛰기




Volumn , Issue , 2010, Pages 67-74

On Locality Sensitive Hashing in metric spaces

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; DATA MODELS; DIFFERENT DOMAINS; DISTANCE FUNCTIONS; EXACT APPROACH; EXACT RESULTS; HASHING FUNCTIONS; LARGE DATABASE; LOCALITY SENSITIVE HASHING; METRIC DATABASE; METRIC SPACES; MULTIMEDIA INFORMATION RETRIEVAL; PROXIMITY SEARCHING; REAL-LIFE DATABASE; SEARCH PROBLEM; SEQUENTIAL SEARCH; SMALL VARIATIONS; SUCCINCT REPRESENTATION; UNIFORM FRAMEWORK; WEB SEARCHES;

EID: 78649845327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1862344.1862355     Document Type: Conference Paper
Times cited : (18)

References (12)
  • 1
    • 70449822913 scopus 로고    scopus 로고
    • Approximate similarity search in metric spaces using inverted files
    • ICST, Brussels, Belgium, Belgium. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
    • Giuseppe Amato and Pasquale Savino. Approximate similarity search in metric spaces using inverted files. In InfoScale '08: Proceedings of the 3rd international conference on Scalable information systems, pages 1-10, ICST, Brussels, Belgium, Belgium, 2008. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
    • (2008) InfoScale '08: Proceedings of the 3rd International Conference on Scalable Information Systems , pp. 1-10
    • Amato, G.1    Savino, P.2
  • 2
    • 37549058056 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • Alexandr Andoni and Piotr Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM, 51(1):117-122, 2008.
    • (2008) Commun ACM , vol.51 , Issue.1 , pp. 117-122
    • Andoni, A.1    Indyk, P.2
  • 3
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • Christian Böhm, Stefan Berchtold, and Daniel A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33(3):322-373, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.A.3
  • 5
    • 0041339760 scopus 로고    scopus 로고
    • Pivot selection techniques for proximity searching in metric spaces
    • B. Bustos, G. Navarro, and E. Chávez. Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters, 24(14):2357-2366, 2003.
    • (2003) Pattern Recognition Letters , vol.24 , Issue.14 , pp. 2357-2366
    • Bustos, B.1    Navarro, G.2    Chávez, E.3
  • 8
    • 78649819387 scopus 로고    scopus 로고
    • Pp-index: Using permutation prefixes for efficient and scalable approximate similarity search
    • Andrea Esuli. Pp-index: Using permutation prefixes for efficient and scalable approximate similarity search. In LSDS-IR 2009 Workshop, 2009.
    • (2009) LSDS-IR 2009 Workshop
    • Esuli, A.1
  • 10
    • 58549114485 scopus 로고    scopus 로고
    • Approximate similarity search: A multi-faceted problem
    • M. Patella and P. Ciaccia. Approximate similarity search: A multi-faceted problem. Journal of Discrete Algorithms, 7(1):36-48, 2009.
    • (2009) Journal of Discrete Algorithms , vol.7 , Issue.1 , pp. 36-48
    • Patella, M.1    Ciaccia, P.2


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