{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:53:59Z","timestamp":1742388839992},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_26","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T04:37:56Z","timestamp":1148013476000},"page":"279-290","source":"Crossref","is-referenced-by-count":19,"title":["On the Least Cost for Proximity Searching in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Karina","family":"Figueroa","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimension. In: Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 573\u2013583 (1994)"},{"key":"26_CR2","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces-index structures for improving the performance of multimedia databases. ACM Computing Surveys\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S1570-8667(03)00067-4","volume":"2","author":"B. Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G.: Probabilistic proximity search algorithms based on compact partitions. Journal of Discrete Algorithms (JDA)\u00a02(1), 115\u2013134 (2003)","journal-title":"Journal of Discrete Algorithms (JDA)"},{"key":"26_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11579427_41","volume-title":"MICAI 2005: Advances in Artificial Intelligence","author":"E. Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Proximity searching in high dimensional spaces with a proximity preserving order. In: Gelbukh, A., de Albornoz, \u00c1., Terashima-Mar\u00edn, H. (eds.) MICAI 2005. LNCS (LNAI), vol.\u00a03789, pp. 405\u2013414. Springer, Heidelberg (2005)"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(02)00344-7","volume":"85","author":"E. Ch\u00e1vez","year":"2003","unstructured":"Ch\u00e1vez, E., Navarro, G.: Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Information Processing Letters\u00a085(1), 39\u201346 (2003)","journal-title":"Information Processing Letters"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.: Proximity searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/582410.582412","volume":"27","author":"P. Ciaccia","year":"2002","unstructured":"Ciaccia, P., Patella, M.: Searching in metric spaces with user-defined and approximate distances. ACM Trans. on Database Systems\u00a027(4), 398\u2013437 (2002)","journal-title":"ACM Trans. on Database Systems"},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/PL00009449","volume":"22","author":"K. Clarkson","year":"1999","unstructured":"Clarkson, K.: Nearest neighbor queries in metric spaces. Discrete Computational Geometry\u00a022(1), 63\u201393 (1999)","journal-title":"Discrete Computational Geometry"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. SIAM J. Discrete Math\u00a017(1), 134\u2013160 (2003)","journal-title":"SIAM J. Discrete Math"},{"key":"26_CR11","unstructured":"Fredriksson, K.: Parallel and memory adaptive metric indexes. Pattern Recognition Letters (to appear)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","volume":"17","author":"L. Mic\u00f3","year":"1996","unstructured":"Mic\u00f3, L., Oncina, J., Carrasco, R.: A fast branch and bound nearest neighbour classifier in metric spaces. Pattern Recognition Letters\u00a017, 731\u2013739 (1996)","journal-title":"Pattern Recognition Letters"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"7","key":"26_CR14","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1142\/S0218001402002003","volume":"16","author":"P. Navarrete","year":"2002","unstructured":"Navarrete, P., Ruiz-Del-Solar, J.: Analysis and comparison of eigenspace-based face recognition approaches. Int. Journal of Pattern Recognition and Artificial Intelligence\u00a016(7), 817\u2013830 (2002)","journal-title":"Int. Journal of Pattern Recognition and Artificial Intelligence"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45735-6_26","volume-title":"String Processing and Information Retrieval","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Paredes, R., Ch\u00e1vez, E.: t-spanners as a data structure for metric space searching. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 298\u2013309. Springer, Heidelberg (2002)"},{"issue":"5","key":"26_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0262-8856(97)00070-X","volume":"16","author":"P. Phillips","year":"1998","unstructured":"Phillips, P., Wechsler, H., Huang, J., Rauss, P.: The FERET database and evaluation procedure for face recognition algorithms. Image and Vision Computing Journal\u00a016(5), 295\u2013306 (1998)","journal-title":"Image and Vision Computing Journal"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal","year":"1986","unstructured":"Vidal, E.: An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters\u00a04, 145\u2013157 (1986)","journal-title":"Pattern Recognition Letters"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0020-0190(95)00161-X","volume":"56","author":"J. Vilar","year":"1995","unstructured":"Vilar, J.: Reducing the overhead of the AESA metric-space nearest neighbor searching algorithm. Information Processing Letters\u00a056, 256\u2013271 (1995)","journal-title":"Information Processing Letters"},{"key":"26_CR19","unstructured":"White, D., Jain, R.: Algorithms and strategies for similarity retrieval. Technical Report VCL-96-101, Visual Computing Laboratory, U. of California (1996)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:10:55Z","timestamp":1619493055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11764298_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}