{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:46Z","timestamp":1725861526771},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_9","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"105-118","source":"Crossref","is-referenced-by-count":3,"title":["Locality-Sensitive Hashing Without False Negatives for $$l_p$$"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Pacuk","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[]},{"given":"Karol","family":"Wegrzycki","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Wygocki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 793\u2013801. ACM (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: K-d trees for semidynamic point sets. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, SCG 1990, pp. 187\u2013197. ACM, New York (1990)","DOI":"10.1145\/98524.98564"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Datar, M., Indyk, P.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG 2004, pp. 253\u2013262. ACM Press (2004)","DOI":"10.1145\/997817.997857"},{"issue":"3","key":"9_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.4064\/sm-70-3-231-283","volume":"70","author":"U Haagerup","year":"1981","unstructured":"Haagerup, U.: The best constants in the Khintchine inequality. Stud. Math. 70(3), 231\u2013283 (1981)","journal-title":"Stud. Math."},{"issue":"301","key":"9_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604\u2013613. ACM, New York (1998)","DOI":"10.1145\/276698.276876"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Pagh, R.: Locality-sensitive hashing without false negatives. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 1\u20139. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch1"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"4119","DOI":"10.1090\/S0002-9939-2010-10450-1","volume":"138","author":"M Veraar","year":"2010","unstructured":"Veraar, M.: On Khintchine inequalities with a weight. Proc. Am. Math. Soc. 138, 4119\u20134121 (2010)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"9_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.tcs.2005.09.023","volume":"348","author":"R Williams","year":"2005","unstructured":"Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348(2), 357\u2013365 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T11:03:20Z","timestamp":1568199800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}