{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:38Z","timestamp":1750308818961,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T00:00:00Z","timestamp":1303084800000},"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":[[2011,4,18]]},"DOI":"10.1145\/1991996.1992050","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["NV-Tree"],"prefix":"10.1145","author":[{"given":"Herwig","family":"Lejsek","sequence":"first","affiliation":[{"name":"Videntifier Technologies Reykjav\u00edk, Iceland"}]},{"given":"Bj\u00f6rn \u00de\u00f3r","family":"J\u00f3nsson","sequence":"additional","affiliation":[{"name":"Reykjavik University, Iceland"}]},{"given":"Laurent","family":"Amsaleg","sequence":"additional","affiliation":[{"name":"IRISA--CNRS Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[2011,4,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-009-0339-z"},{"key":"e_1_3_2_1_2_1","volume-title":"Locality-sensitive hashing using stable distributions","author":"Datar M.","year":"2006","unstructured":"M. Datar , P. Indyk , N. Immorlica , and V. Mirrokni . Locality-sensitive hashing using stable distributions . MIT Press , 2006 . M. Datar, P. Indyk, N. Immorlica, and V. Mirrokni. Locality-sensitive hashing using stable distributions. MIT Press, 2006."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646421"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872795"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459388"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.130"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877972.1877973"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. NIPS","author":"Liu T.","year":"2004","unstructured":"T. Liu , A. Moore , A. Gray , and K. Yang . An investigation of practical approximate nearest neighbor algorithms . In Proc. NIPS , Vancouver, BC, Canada , 2004 . T. Liu, A. Moore, A. Gray, and K. Yang. An investigation of practical approximate nearest neighbor algorithms. In Proc. NIPS, Vancouver, BC, Canada, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"e_1_3_2_1_11_1","volume-title":"Dynamic behavior of balanced NV-trees. Multimedia Systems, 17(2)","author":"\u00d3lafsson A.","year":"2011","unstructured":"A. \u00d3lafsson , B. T. J\u00f3nsson , L. Amsaleg , and H. Lejsek . Dynamic behavior of balanced NV-trees. Multimedia Systems, 17(2) , 2011 . A. \u00d3lafsson, B. T. J\u00f3nsson, L. Amsaleg, and H. Lejsek. Dynamic behavior of balanced NV-trees. Multimedia Systems, 17(2), 2011."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of Electronic Imaging, Security and Watermarking of Multimedia Contents III","author":"F. A.","year":"2001","unstructured":"F. A. P. Petitcolas et al. A public automated web-based evaluation service for watermarking schemes: StirMark benchmark . In Proc. of Electronic Imaging, Security and Watermarking of Multimedia Contents III , San Jose, CA, USA , 2001 . F. A. P. Petitcolas et al. A public automated web-based evaluation service for watermarking schemes: StirMark benchmark. In Proc. of Electronic Imaging, Security and Watermarking of Multimedia Contents III, San Jose, CA, USA, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383172"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587635"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166077"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/946247.946751"},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. CVPR","author":"Wu Z.","year":"2009","unstructured":"Z. Wu , Q. Ke , M. Isard , and J. Sun . Bundling features for large scale partial-duplicate web image search . In Proc. CVPR , Miami, FL, USA , 2009 . Z. Wu, Q. Ke, M. Isard, and J. Sun. Bundling features for large scale partial-duplicate web image search. In Proc. CVPR, Miami, FL, USA, 2009."}],"event":{"name":"ICMR'11: International Conference on Multimedia Retrieval","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Trento Italy","acronym":"ICMR'11"},"container-title":["Proceedings of the 1st ACM International Conference on Multimedia Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1991996.1992050","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1991996.1992050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:38Z","timestamp":1750278398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1991996.1992050"}},"subtitle":["nearest neighbors at the billion scale"],"short-title":[],"issued":{"date-parts":[[2011,4,18]]},"references-count":17,"alternative-id":["10.1145\/1991996.1992050","10.1145\/1991996"],"URL":"https:\/\/doi.org\/10.1145\/1991996.1992050","relation":{},"subject":[],"published":{"date-parts":[[2011,4,18]]},"assertion":[{"value":"2011-04-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}