{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:46:26Z","timestamp":1743104786217,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220111"},{"type":"electronic","value":"9783642220128"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22012-8_48","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T07:29:39Z","timestamp":1308382179000},"page":"601-612","source":"Crossref","is-referenced-by-count":3,"title":["Content Search through Comparisons"],"prefix":"10.1007","author":[{"given":"Amin","family":"Karbasi","sequence":"first","affiliation":[]},{"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Massouli\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7551\/mitpress\/4908.003.0005","volume-title":"Nearest-Neighbor Methods for Learning and Vision: Theory and Practice","author":"K.L. Clarkson","year":"2006","unstructured":"Clarkson, K.L.: Nearest-neighbor searching and metric space dimensions. In: Shakhnarovich, G., Darrell, T., Indyk, P. (eds.) Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pp. 15\u201359. MIT Press, G.\u00a0Shakhnarovich (2006)"},{"key":"48_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.: Elements of Information Theory. Wiley, Chichester (1991)"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Giakkoupis, G.: On the searchability of small-world networks with arbitrary underlying structure. In: STOC (2010)","DOI":"10.1145\/1806689.1806744"},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11841036_35","volume-title":"Algorithms \u2013 ESA 2006","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Lebhar, E., Lotker, Z.: A doubling dimension threshold \u03b8(loglogn) for augmented graph navigability. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 376\u2013386. Springer, Heidelberg (2006)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Goyal, N., Lifshits, Y., Schutze, H.: Disorder inequality: a combinatorial approach to nearest neighbor search. In: WSDM (2008)","DOI":"10.1145\/1341531.1341538"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"48_CR7","unstructured":"Karbasi, A., Ioannidis, S., Massoulie, L.: Content search through comparisons. Tech. Rep. CR-PRL-2010-07-0002, Technicolor (2010)"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Karger, D., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: SODA (2002)","DOI":"10.1145\/509907.510013"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: STOC (2000)","DOI":"10.1145\/335305.335325"},{"key":"48_CR10","unstructured":"Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: SODA (2004)"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Lifshits, Y., Zhang, S.: Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. In: SODA (2009)","DOI":"10.1137\/1.9781611973068.36"},{"key":"48_CR12","unstructured":"Tschopp, D., Diggavi, S.N.: Approximate nearest neighbor search through comparisons (2009)"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Tschopp, D., Diggavi, S.N.: Facebrowsing: Search and navigation through comparisons. In: ITA Workshop (2010)","DOI":"10.1109\/ITA.2010.5454139"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"White, R., Roth, R.: Exploratory Search: Beyond the Query-Response Paradigm. Morgan & Claypool (2009)","DOI":"10.2200\/S00174ED1V01Y200901ICR003"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22012-8_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T19:01:21Z","timestamp":1712516481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}