Simple space-time trade-offs for AESA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4525 LNCS, Issue , 2007, Pages 229-241

  Figueroa, Karina ^a   Fredriksson, Kimmo ^b  

^a Universidad Michoacana Mexico   (Mexico)

^b UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; QUERY PROCESSING;

CONSTRUCTION COSTS; DISTANCE VALUES; UPPER BOUNDS SUFFICE;

COMPUTATIONAL METHODS;

EID: 37149038287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_18     Document Type: Conference Paper

References (13)

1. Chavez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters 26(9), 1363-1376 (2005)
2. Chavez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.: Proximity searching in metric spaces. ACM Computing Surveys 33(3), 273-321 (2001)
3. Figueroa, K., Chavez, E., Navarro, G., Paredes, R.: On the lower cost for proximity searching in metric spaces. In: Alvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 270-290. Springer, Heidelberg (2006)
4. Fredriksson, K.: Engineering efficient metric indexes. Pattern Recognition Letters (PRL) 28(1), 75-84 (2007)
5. Gao, W., Cao, B., Zhou, S., Zhang, X., Zhao, D.: The CAS-PEAL large scale chinese face database and evaluation protocols. Technical report, Join Reserarch & Development Laboratory, CAS, 2004. JDL_TR_04_FR_001
6. González, R., Navarro, G.: Statistical encoding of succinct data structures. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 295-306. Springer, Heidelberg (2006)
7. Hjaltason, G., Samet, H.: Index-driven similarity search in metric spaces. ACM Transactions Database Systems 28(4), 517-580 (2003)
8. Micó, 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 15, 9-17 (1994)
9. Navarro, G., Paredes, R., Chávez, E.: t-spanners as a data structure for metric space searching. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 298-309. Springer, Heidelberg (2002)
10. Pagh, R.: Low redundancy in static dictionaries with constant query time. SIAM J. Comput. 31(2), 353-363 (2001)
11. Uhlmann, J.: Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, pp. 175-179 (1991)
12. Vidal, E.: An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters 4, 145-157 (1986)
13. Yianilos, P.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. 4th ACM-SIAM Symposium of Discrete Algorithms (SODA'93), SIAM Press, pp. 311-321 (1993)