Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects

Searching in metric spaces

ACM Computing Surveys (CSUR)

Using the Real Dimension of the Data

DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery

Probabilistic Proximity Searching Algorithms Based on Compact Partitions

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval

Searching in metric spaces by spatial approximation

The VLDB Journal — The International Journal on Very Large Data Bases

Index-driven similarity search in metric spaces (Survey Article)

ACM Transactions on Database Systems (TODS)

Probabilistic proximity searching algorithms based on compact partitions

Journal of Discrete Algorithms - SPIRE 2002

Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces

IEEE Transactions on Knowledge and Data Engineering

A compact space decomposition for effective metric indexing

Pattern Recognition Letters

Combining elimination rules in tree-based nearest neighbor search algorithms

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition

Distributed antipole clustering for efficient data search and management in Euclidean and metric spaces

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Impact of the initialization in tree-based fast similarity search techniques

SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition

A log square average case algorithm to make insertions in fast similarity search

Pattern Recognition Letters