Bibliografía

AGG

G. Nuñez A. García, G. L. Martínez and A. Guzmán.
Página www.
http://148.204.20.3/artmin/kd/REPOR_TE.htm.

Ben75

J. Bentley.
Multidimensional binary search trees used for associative searching.
Comm. of the ACM, 18(9):509-517, 1975.

BK73

W. Burkhard and R. Keller.
Some approaches to best-match file searching.
Comm. of the ACM, 16(4):230-236, April 1973.

BO97

T. Bozkaya and M. Ozsoyoglu.
Distance-based indexing for high-dimensional metric spaces.
In Proc. ACM SIGMOD International Conference on Management of Data, pages 357-368, 1997.
Sigmod Record 26(2).

Bri95

S. Brin.
Near neighbor search in large metric spaces.
In Proc. 21st Conference on Very Large Databases (VLDB'95), pages 574-584, 1995.

BYCMW94

R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu.
Proximity matching using fixed-queries trees.
In Proc. 5th Combinatorial Pattern Matching (CPM'94), LNCS 807, pages 198-212, 1994.

CFG99

E. Chávez, K. Figueroa, and M. García.
Una estructura dinámica para búsqueda de similaridad.
Encuentro nacional de computación, 1999.

Chá97

E. Chávez.
Algoritmos para detección de cúmulos en nubes de datos.
4a. Jornadas Iberoamericanas de Informatica., 1997.

Che

P. Chew.
Página www.
http://www.cs.corNell.edu/Info/People/chew/Delaunay.html.

Chi95

L. Childs.
A Concrete Introduction to Higher Algebra.
Springer-Verlag, 1995.

Cla83

K.L. Clarkson.
Fast algorithm for the all neares neighbors problem, 1983.

CMN99

E. Chávez, J. Marroquín, and G. Navarro.
Overcoming the curse of dimensionality.
Technical report, Universidad Michoacana, México, 1999.
Submitted to the European Workshop on Content-Based Multimedia Indexing (CBMI'99). ftp://garota.fismat.umich.mx/pub/users/elchavez/fqa.ps.gz.

CN99

E. Chávez and G. Navarro.
Measuring the dimensionality of general metric spaces.
Technical report, Dept. of Computer Science, Univ. of Chile, 1999.

CNBYM99

E. Chávez, G. Navarro, R. Baeza-Yates, and J. Marroquín.
Searching in metric spaces.
Technical Report TR/DCC-99-3, Dept. of Computer Science, Univ. of Chile, 1999.
ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/survmetric.ps.gz.

MB96

A.J. Quiroz M.R. Brito, E. Chávez.
Connectivity of the mutual $k$-nearest-neighbor graph in clustering and outlier detection.
Statistics & probability y letters, 1996.

MDAS98

N. Santoro M. D. Atkinson, J-R. Sack and T. Strothotte.
Min-max heaps and generalized priority queues.
Communications of the ACM, 29(10), 1998.

Nav99a

G. Navarro.
Searching in metric spaces by spatial approximation.
In Proc. String Processing and Information Retrieval (SPIRE'99), Cancun, Mexico, September 1999.
To appear. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/metric.ps.gz.

Nav99b

G. Navarro.
Searching in metric spaces by spatial approximation.
String processing and Information Retiveral, 1999.

NBY00

G. Navarro. and R. Baeza-Yates.
A guided tour to approximates string matching.
ACM Computing Surveys, 2000.
To appear.

RI

Dimacs Research and Education Institute.
Página www.
http://dimacs.rutgers.edu/drei/96/classroom/voronoi/intro.html.

Sed92

R. Sedgewick.
Algorithms in C.
Addison-Wesley, 1992.

Uhl91

J. Uhlmann.
Satisfying general proximity/similarity queries with metric trees.
Information Processing Letters, 40:175-179, 1991.

USC

USC.
Página www.
http://neuroscholar.usc.edu/documentation/nmds_analyses.htm.

VAnl89

P. Vaidya, O. An, and n log.
algorithm for the all-nearest-neighbor problem, 1989.

Vid86

E. Vidal.
An algorithm for finding nearest neighbors in (approximately) constant average time.
Pattern Recognition Letters, 4:145-157, 1986.

Yaz

M. Yazdani.
Página www.
http://www.media.uwe.ac.uk/masoud/course/hci/papers/ojeda/reading.htm.

yEC00

H. Tejeda y E. Chávez.
Una gráfica de proximidad para búsqueda de similaridad.
Technical report, Facultad de Ing. Eléctrica, 2000.

Yia93

P. Yianilos.
Data structures and algorithms for nearest neighbor search in general metric spaces.
In Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pages 311-321, 1993.