{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:51:09Z","timestamp":1755838269500,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T00:00:00Z","timestamp":1338854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7 - 248984"],"award-info":[{"award-number":["FP7 - 248984"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,5]]},"DOI":"10.1145\/2324796.2324847","type":"proceedings-article","created":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T11:53:15Z","timestamp":1341316395000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Distributed KNN-graph approximation via hashing"],"prefix":"10.1145","author":[{"given":"Mohamed Riadh","family":"Trad","sequence":"first","affiliation":[{"name":"INRIA Paris-Rocquencourt, Le Chesnay Cedex, France"}]},{"given":"Alexis","family":"Joly","sequence":"additional","affiliation":[{"name":"INRIA Sophia-Antipolis, Montpellier Cedex, France"}]},{"given":"Nozha","family":"Boujemaa","sequence":"additional","affiliation":[{"name":"INRIA Saclay, Orsay cedex, France"}]}],"member":"320","published-online":{"date-parts":[[2012,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_4_1","volume-title":"IEEE Computer Society Conference on, 0: 1--8","author":"Boiman O.","year":"2008","unstructured":"O. Boiman , E. Shechtman , and M. Irani . In defense of nearest-neighbor based image classification. Computer Vision and Pattern Recognition , IEEE Computer Society Conference on, 0: 1--8 , 2008 . O. Boiman, E. Shechtman, and M. Irani. In defense of nearest-neighbor based image classification. Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, 0:1--8, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(96)00213-1"},{"key":"e_1_3_2_1_6_1","first-page":"2161","volume-title":"Proc. Int. Symp. on Music Information Retrieval","author":"Casey M.","year":"2006","unstructured":"M. Casey and M. Slaney . Song intersection by approximate nearest neighbour search . In Proc. Int. Symp. on Music Information Retrieval , pages 2161 -- 2168 , 2006 . M. Casey and M. Slaney. Song intersection by approximate nearest neighbour search. In Proc. Int. Symp. on Music Information Retrieval, pages 2161--2168, 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.22.50"},{"key":"e_1_3_2_1_9_1","first-page":"426","volume-title":"Int. Conf. on Very Large Data Bases","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In Int. Conf. on Very Large Data Bases , pages 426 -- 435 , 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In Int. Conf. on Very Large Data Bases, pages 426--435, 1997."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_11_1","first-page":"10","volume-title":"Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation -","volume":"6","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: simplified data processing on large clusters . In Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 , pages 10 -- 10 , Berkeley, CA, USA , 2004 . USENIX Association. J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. In Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6, pages 10--10, Berkeley, CA, USA, 2004. USENIX Association."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_1_14_1","first-page":"518","volume-title":"Int. Conf. on Very Large Data Bases","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In Int. Conf. on Very Large Data Bases , pages 518 -- 529 , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Int. Conf. on Very Large Data Bases, pages 518--529, 1999."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671516"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_17_1","volume-title":"WebDB","author":"Haghani P.","year":"2008","unstructured":"P. Haghani , S. Michel , P. Cudr\u00e9-Mauroux , and K. Aberer . Lsh at large - distributed knn search in high dimensions . In WebDB , 2008 . P. Haghani, S. Michel, P. Cudr\u00e9-Mauroux, and K. Aberer. Lsh at large - distributed knn search in high dimensions. In WebDB, 2008."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88682-2_24"},{"key":"e_1_3_2_1_19_1","article-title":"Product quantization for nearest neighbor search","author":"J\u00e9gou H.","year":"2010","unstructured":"H. J\u00e9gou , M. Douze , and C. Schmid . Product quantization for nearest neighbor search . IEEE Transactions on Pattern Analysis & Machine Intelligence , 2010 . to appear. H. J\u00e9gou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. IEEE Transactions on Pattern Analysis & Machine Intelligence, 2010. to appear.","journal-title":"IEEE Transactions on Pattern Analysis & Machine Intelligence"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027527.1027729"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMT.2011.6002015"},{"key":"e_1_3_2_1_25_1","first-page":"825","volume-title":"An investigation of practical approximate nearest neighbor algorithms","author":"Liu T.","year":"2004","unstructured":"T. Liu , A. W. Moore , A. Gray , and K. Yang . An investigation of practical approximate nearest neighbor algorithms . pages 825 -- 832 . MIT Press , 2004 . T. Liu, A. W. Moore, A. Gray, and K. Yang. An investigation of practical approximate nearest neighbor algorithms. pages 825--832. MIT Press, 2004."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.148"},{"key":"e_1_3_2_1_27_1","first-page":"331","volume-title":"VISAPP (1)","author":"Muja M.","year":"2009","unstructured":"M. Muja and D. G. Lowe . Fast approximate nearest neighbors with automatic algorithm configuration . In VISAPP (1) , pages 331 -- 340 , 2009 . M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISAPP (1), pages 331--340, 2009."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.04.004"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICVGIP.2008.103"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_11"},{"key":"e_1_3_2_1_31_1","first-page":"1509","volume-title":"NIPS","author":"Raginsky M.","year":"2009","unstructured":"M. Raginsky and S. Lazebnik . Locality-sensitive binary codes from shift-invariant kernels. In Y. Bengio, D. Schuurmans, J. D. Lafferty, C. K. I. Williams, and A. Culotta, editors , NIPS , pages 1509 -- 1517 . Curran Associates, Inc. , 2009 . M. Raginsky and S. Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In Y. Bengio, D. Schuurmans, J. D. Lafferty, C. K. I. Williams, and A. Culotta, editors, NIPS, pages 1509--1517. Curran Associates, Inc., 2009."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135834"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1197919"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1991996.1992049"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839707.1839759"},{"key":"e_1_3_2_1_37_1","first-page":"194","volume-title":"Int. Conf. on Very Large Data Bases","author":"Weber R.","year":"1998","unstructured":"R. Weber , H. J. Schek , and S. Blott . A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces . In Int. Conf. on Very Large Data Bases , pages 194 -- 205 , 1998 . R. Weber, H. J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Int. Conf. on Very Large Data Bases, pages 194--205, 1998."},{"key":"e_1_3_2_1_38_1","first-page":"1753","volume-title":"NIPS","author":"Weiss Y.","year":"2008","unstructured":"Y. Weiss , A. Torralba , and R. Fergus . Spectral hashing . In NIPS , pages 1753 -- 1760 , 2008 . Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753--1760, 2008."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.12"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050069"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989428"}],"event":{"name":"ICMR '12: International Conference on Multimedia Retrieval","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Hong Kong China","acronym":"ICMR '12"},"container-title":["Proceedings of the 2nd ACM International Conference on Multimedia Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2324796.2324847","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2324796.2324847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:09Z","timestamp":1750243929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2324796.2324847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,5]]},"references-count":40,"alternative-id":["10.1145\/2324796.2324847","10.1145\/2324796"],"URL":"https:\/\/doi.org\/10.1145\/2324796.2324847","relation":{},"subject":[],"published":{"date-parts":[[2012,6,5]]},"assertion":[{"value":"2012-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}