{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:26Z","timestamp":1759637606105,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046507"},{"type":"electronic","value":"9783030046514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_31","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"465-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with $$O(\\log {n})$$ Query Time"],"prefix":"10.1007","author":[{"given":"Hengzhao","family":"Ma","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 47th Annual IEEE Symposium on Foundations of Computer Science, vol. 51, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"31_CR2","unstructured":"Andoni, A., Indyk, P.: Nearest neighbors in high-dimensional spaces. In: Handbook of Discrete and Computational Geometry, 3rd edn, chap. 43, pp. 1135\u20131155. CRC Press Inc., Boca Raton (2017)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 793\u2013801 (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"31_CR4","unstructured":"Arya, S., Mount, D.M.: Approximate nearest neighbor queries in fixed dimensions. In: Proceedings of the Fourth Annual Symposium on Discrete Algorithms, pp. 271\u2013280 (1993)"},{"issue":"6","key":"31_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(93)90222-U","volume":"45","author":"MW Bern","year":"1993","unstructured":"Bern, M.W.: Approximate closest-point queries in high dimensions. Inf. Process. Lett. 45(2), 95\u201399 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"PB Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42(1), 67\u201390 (1995)","journal-title":"J. ACM"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Approximate nearest neighbor queries revisited. In: Proceedings of the Thirteenth Annual Symposium on Computational Geometry, vol. 20, pp. 352\u2013358 (1997)","DOI":"10.1145\/262839.263001"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-table distributions. In: Proceedings of the Twentieth annual Symposium on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"key":"31_CR11","unstructured":"Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 769\u2013778 (2001)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: A replacement for voronoi diagrams of near linear size. In: 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 94\u2013103 (2001)","DOI":"10.1109\/SFCS.2001.959884"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","volume":"8","author":"S Har-Peled","year":"2012","unstructured":"Har-Peled, S., Indyk, P., Motwani, R.: Approximate nearest neighbor: towards removing the curse of dimensionality. Theory Comput. 8(1), 321\u2013350 (2012)","journal-title":"Theory Comput."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Two algorithms for nearest-neighbor search in high dimensions. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, pp. 599\u2013608 (1997)","DOI":"10.1145\/258533.258653"},{"key":"31_CR16","unstructured":"Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 798\u2013807 (2004)"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539798347177","volume":"30","author":"E Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R., Rabani, Y.: Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30(2), 457\u2013474 (2000)","journal-title":"SIAM J. Comput."},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Ma, H., Li, J.: An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time (2018). http:\/\/arxiv.org\/abs\/1809.09776","DOI":"10.1007\/978-3-030-04651-4_31"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Panigrahy, R.: Entropy based nearest neighbor search in high dimensions. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1186\u20131195 (2006)","DOI":"10.1145\/1109557.1109688"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: An optimal algorithm for the all-nearest-neighbors problem. In: 27th Annual Symposium on Foundations of Computer Science, pp. 117\u2013122 (1986)","DOI":"10.1109\/SFCS.1986.8"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:50:32Z","timestamp":1710345032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}