Eric Sadit Tellez

Learn More
Many pattern recognition tasks can modeled as proximity searching. From nearest neighbor classification to multimedia databases the common task is to quickly find all the elements close to a given query. This task can be accomplished very easily by sequentially examining all the elements in the collection, but turns to be impractical in two situations: when(More)
Proximity searching is the problem of retrieving, from a given database, those objects closest to a query. To avoid exhaustive searching, data structures called indexes are built on the database prior to serving queries. The curse of dimensionality is a well-known problem for indexes: in spaces with sufficiently concentrated distance histograms, no index(More)