Pages that link to "Item:Q1183466"

The following pages link to Satisfying general proximity/similarity queries with metric trees (Q1183466):

Displaying 22 items.

• On the geometry of similarity search: dimensionality curse and concentration of measure (Q294719) (← links)
• Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results (Q346495) (← links)
• Pivot selection: dimension reduction for distance-based indexing (Q450522) (← links)
• Probabilistic proximity searching algorithms based on compact partitions (Q876710) (← links)
• A scalable re-ranking method for content-based image retrieval (Q903669) (← links)
• Parallel query processing on distributed clustering indexes (Q1013068) (← links)
• Solving similarity joins and range queries in metric spaces with the list of twin clusters (Q1013069) (← links)
• Counting distance permutations (Q1013072) (← links)
• Exploiting distance coherence to speed up range queries in metric indexes (Q1041769) (← links)
• Modeling a dynamic environment using a Bayesian multiple hypothesis approach (Q1327165) (← links)
• Distance-based index structures for fast similarity search (Q1709472) (← links)
• A parallel computing framework for big data (Q1712556) (← links)
• Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
• Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances (Q2001629) (← links)
• Random projection-based auxiliary information can improve tree-based nearest neighbor search (Q2055550) (← links)
• Counts-of-counts similarity for prediction and search in relational data (Q2218368) (← links)
• Efficient data structures for model-free data-driven computational mechanics (Q2237265) (← links)
• Fast filtering false active subspaces for efficient high dimensional similarity processing (Q2267039) (← links)
• Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths (Q2670886) (← links)
• Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions (Q2830635) (← links)
• Dual‐tree fast exact max‐kernel search (Q4969941) (← links)
• An optimal-transport finite-particle method for mass diffusion (Q6084533) (← links)