DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» IDistance
IDistance
Pivot Selection Method for Optimizing Both Pruning and Balancing in Metric Space Indexes
Peer-To-Peer Similarity Search Based on M-Tree Indexing
Similarity Searching in Peer-To-Peer Environment
Prefix Hash Tree an Indexing Data Structure Over Distributed Hash
Efficient Nearest-Neighbor Computation for GPU-Based Motion
Distributed Computation of the Knn Graph for Large High-Dimensional Point Sets
Indexing the Fully Evolvement of Spatiotemporal Objects
K-NN Search in Non-Clustered Case Using K-P-Tree
Efficient Similarity Search in High-Dimensional Data Spaces
High-Dimensional Data Indexing with Applications
Very Large Scale Nearest Neighbor Search: Ideas, Strategies and Challenges
Making the Pyramid Technique Robust to Query Types and Workloads
A Comprehensive Study of Idistance Partitioning Strategies for Knn Queries and High-Dimensional Data Indexing -. [ Tim Wylie
Data Transformation for Improved Query Performance
Virtual Forced Splitting in Multidimensional Access Methods
Efficient Indexing Methods in the Data Mining Context
Adaptive Cluster Distance Bounding for High Dimensional Indexing+
Efficient and Accurate Nearest Neighbor and Closest Pair Search In
Top View
Query and Update Efficient B+-Tree Based Indexing of Moving Objects
Accurate and Efficient Near Neighbor Search in High Dimensional Spaces
Data Transformation for Improved Query Performance
Orthogonal Range Search Approach Using FGBC-Idistance
Optimized High-Dimensional Knn Search with Bregman Distances
Binary Trees, While 3-Ary Trees Are Sometimes Called Ternary Trees
Efficient Random Projection Trees for Nearest Neighbor Search and Related Problems
Mitigating the Curse of Dimensionality for Exact Knn Retrieval
Quality and Efficiency in High Dimensional Nearest Neighbor
Indexing Metric Spaces for Exact Similarity Search
Efficient Metric Indexing for Similarity Search Lu Chen #1, Yunjun Gao #2, Xinhan Li #3, Christian S
SIMP: Accurate and Efficient Near Neighbor Search in High Dimensional Spaces
Optimizing Similarity Search in the M-Tree
Subspace Clustering for Indexing High Dimensional Data: a Main Memory Index Based on Local Reductions and Individual Multi-Representations
M-Chord: a Scalable Distributed Similarity Search Structure
The ML-Index: a Multidimensional, Learned Index for Point, Range, and Nearest-Neighbor Queries
Quantitative Analysis of Nearest-Neighbors Search in High-Dimensional Sampling-Based Motion Planning
SIMILARITY SEARCH the Metric Space Approach