{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:20Z","timestamp":1750306940383,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T00:00:00Z","timestamp":1380412800000},"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":[[2013,9,29]]},"DOI":"10.1145\/2499178.2499189","type":"proceedings-article","created":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T13:27:04Z","timestamp":1381238824000},"page":"101-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Nearest-Neighbor Search in the Probability Simplex"],"prefix":"10.1145","author":[{"given":"Kriste","family":"Krstovski","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Massachusetts, Amherst, MA, 01003, U.S.A."}]},{"given":"David A.","family":"Smith","sequence":"additional","affiliation":[{"name":"College of Computer and Information Science, Northeastern University, Boston, MA, 02115, U.S.A."}]},{"given":"Hanna M.","family":"Wallach","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Massachusetts, Amherst, MA, 01003, U.S.A."}]},{"given":"Andrew","family":"McGregor","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Massachusetts, Amherst, MA, 01003, U.S.A."}]}],"member":"320","published-online":{"date-parts":[[2013,9,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74958-5_60"},{"key":"e_1_3_2_1_2_1","unstructured":"A. Andoni and P. Indyk. LSH Algorithm and Implementation(E2LSH) 2005. http:\/\/www.mit.edu\/~andoni\/LSH\/.  A. Andoni and P. Indyk. LSH Algorithm and Implementation(E2LSH) 2005. http:\/\/www.mit.edu\/~andoni\/LSH\/."},{"key":"e_1_3_2_1_3_1","first-page":"61","volume-title":"Nearest Neighbor Methods in Learning and Vision: Theory and Practice","author":"Andoni A.","year":"2005"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020503"},{"key":"e_1_3_2_1_5_1","first-page":"271","volume-title":"Proc. ACM-SIAM Sympos. Discrete Algorithms","author":"Arya S.","year":"1993"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"issue":"1","key":"e_1_3_2_1_7_1","first-page":"17","article-title":"A correlated topic model of Science","volume":"1","author":"Blei D. M.","year":"2007","journal-title":"AAS"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"volume-title":"EMNLP","year":"2010","author":"Boyd-Graber J.","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_3_2_1_12_1","first-page":"1","volume-title":"Advances Information Retrieval: Recent Research from the CIIR","author":"Croft W. B.","year":"2000"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348385"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11735106_63"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109637"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1613715.1613763"},{"key":"e_1_3_2_1_19_1","first-page":"856","volume-title":"NIPS","author":"Hoffman M.","year":"2010"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_22_1","first-page":"207","volume-title":"Proc. Workshop on Statistical MT","author":"Krstovski K.","year":"2011"},{"volume-title":"Proc. Workshop on Statistical MT","year":"2013","author":"Krstovski K.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577097"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61115"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1670564.1670576"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1699571.1699627"},{"key":"e_1_3_2_1_28_1","unstructured":"D. M. Mount and S. Arya. ANN: A Library for Approximate Nearest Neighbor Searching 2010. http:\/\/www.cs.umd.edu\/~mount\/ANN\/.  D. M. Mount and S. Arya. ANN: A Library for Approximate Nearest Neighbor Searching 2010. http:\/\/www.cs.umd.edu\/~mount\/ANN\/."},{"key":"e_1_3_2_1_29_1","unstructured":"U. S. Patent and T. Office. Patent full-text databases January 2012. http:\/\/patft.uspto.gov.  U. S. Patent and T. Office. Patent full-text databases January 2012. http:\/\/patft.uspto.gov."},{"volume-title":"NAACL","year":"2010","author":"Petrovic S.","key":"e_1_3_2_1_30_1"},{"key":"e_1_3_2_1_31_1","first-page":"251","volume-title":"EMNLP","author":"Platt J.","year":"2010"},{"key":"e_1_3_2_1_32_1","article-title":"Its measurement, decomposition, apportionment and analysis. Sankhy\u0101","author":"Rao C. R.","year":"1982","journal-title":"The Indian Journal of Statistics, 44(A1):1--22"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219917"},{"key":"e_1_3_2_1_34_1","first-page":"243","volume-title":"TREC-2","author":"Shaw J. A.","year":"1994"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871888"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1619"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850703"},{"volume-title":"NIPS","year":"2009","author":"Wallach H. M.","key":"e_1_3_2_1_38_1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148204"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646295"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458317"}],"event":{"name":"ICTIR '13: International Conference on the Theory of Information Retrieval","sponsor":["Findwise Findwise AB","Google Inc.","Spinque Spinque","Univ. of Copenhagen University of Copenhagen","LARM LARM Audio Research Archive","Royal School of Library and Information Science Royal School of Library and Information Science","Yahoo! Labs","SIGIR ACM Special Interest Group on Information Retrieval","British Computer Society BCS"],"location":"Copenhagen Denmark","acronym":"ICTIR '13"},"container-title":["Proceedings of the 2013 Conference on the Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2499178.2499189","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2499178.2499189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:50Z","timestamp":1750235750000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2499178.2499189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,29]]},"references-count":41,"alternative-id":["10.1145\/2499178.2499189","10.1145\/2499178"],"URL":"https:\/\/doi.org\/10.1145\/2499178.2499189","relation":{},"subject":[],"published":{"date-parts":[[2013,9,29]]},"assertion":[{"value":"2013-09-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}