{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:32Z","timestamp":1750306352896,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,28]]},"DOI":"10.1145\/2949035.2949042","type":"proceedings-article","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T13:43:49Z","timestamp":1467035029000},"page":"25-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["High-dimensional visual similarity search"],"prefix":"10.1145","author":[{"given":"Yannis","family":"Avrithis","sequence":"first","affiliation":[{"name":"Department of Informatics & Telecommunications University Of Athens Athens, Greece"}]},{"given":"Ioannis Z.","family":"Emiris","sequence":"additional","affiliation":[{"name":"Department of Informatics & Telecommunications University Of Athens Athens, Greece"}]},{"given":"Georgios","family":"Samaras","sequence":"additional","affiliation":[{"name":"Department of Informatics & Telecommunications University Of Athens Athens, Greece"}]}],"member":"320","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"436","volume-title":"Proc. Annual Symp. on Computational Geometry","author":"Anagnostopoulos E.","year":"2015","unstructured":"E. Anagnostopoulos , I. Emiris , and I. Psarros . Low-quality dimension reduction and high-dimensional approximate nearest neighbor . In Proc. Annual Symp. on Computational Geometry , pages 436 -- 450 , 2015 . E. Anagnostopoulos, I. Emiris, and I. Psarros. Low-quality dimension reduction and high-dimensional approximate nearest neighbor. In Proc. Annual Symp. on Computational Geometry, pages 436--450, 2015."},{"key":"e_1_3_2_1_2_1","unstructured":"A. Andoni and P. Indyk. E2LSH 0.1 User Manual Implementation of LSH: E2LSH http:\/\/www.mit.edu\/~andoni\/LSH 2005.  A. Andoni and P. Indyk. E2LSH 0.1 User Manual Implementation of LSH: E2LSH http:\/\/www.mit.edu\/~andoni\/LSH 2005."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"e_1_3_2_1_6_1","volume-title":"Ann: A library for approximate nearest neighbor searching, https:\/\/www.cs.umd.edu\/mount\/ann\/","author":"Mount D. M.","year":"2010","unstructured":"D. M. Mount and S. Arya . Ann: A library for approximate nearest neighbor searching, https:\/\/www.cs.umd.edu\/mount\/ann\/ , 2010 . D. M. Mount and S. Arya. Ann: A library for approximate nearest neighbor searching, https:\/\/www.cs.umd.edu\/mount\/ann\/, 2010."},{"key":"e_1_3_2_1_7_1","first-page":"331","volume-title":"Proc. VISAPP: Intern. Conf. Computer Vision Theory & Appl.","author":"Muja M.","year":"2009","unstructured":"M. Muja and D. Lowe . Fast approximate nearest neighbors with automatic algorithm configuration . In Proc. VISAPP: Intern. Conf. Computer Vision Theory & Appl. , pages 331 -- 340 , 2009 . M. Muja and D. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In Proc. VISAPP: Intern. Conf. Computer Vision Theory & Appl., pages 331--340, 2009."},{"key":"e_1_3_2_1_8_1","volume-title":"Pattern Analysis and Machine Intelligence","author":"Muja M.","year":"2014","unstructured":"M. Muja and D. Lowe . Scalable nearest neighbour algorithms for high dimensional data . Pattern Analysis and Machine Intelligence , 2014 . M. Muja and D. Lowe. Scalable nearest neighbour algorithms for high dimensional data. Pattern Analysis and Machine Intelligence, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383172"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"e_1_3_2_1_11_1","first-page":"48","volume-title":"Proc. Foundations Software Techn. & Theor. Comp. Science","author":"Vempala S.","year":"2012","unstructured":"S. Vempala . Randomly-oriented kd-trees adapt to intrinsic dimension . In Proc. Foundations Software Techn. & Theor. Comp. Science , pages 48 -- 57 , 2012 . S. Vempala. Randomly-oriented kd-trees adapt to intrinsic dimension. In Proc. Foundations Software Techn. & Theor. Comp. Science, pages 48--57, 2012."}],"event":{"name":"CGI '16: Computer Graphics International","sponsor":["FORTH Foundation for Research and Technology - Hellas"],"location":"Heraklion Greece","acronym":"CGI '16"},"container-title":["Proceedings of the 33rd Computer Graphics International"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949035.2949042","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2949035.2949042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:59Z","timestamp":1750222559000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949035.2949042"}},"subtitle":["k-d Generalized Randomized Forests"],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":11,"alternative-id":["10.1145\/2949035.2949042","10.1145\/2949035"],"URL":"https:\/\/doi.org\/10.1145\/2949035.2949042","relation":{},"subject":[],"published":{"date-parts":[[2016,6,28]]},"assertion":[{"value":"2016-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}