No article text was recorded for this version.
curse of dimensionality (high-dimensional search complexity)
Version 2 of 2213 papers234 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fast Neighborhood Graph Search Using Cartesian Concatenation
- Blog: Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions
- Blog: Approximate Furthest Neighbor with Application to Annulus Query
- Blog: HDIdx: High-Dimensional Indexing for Efficient Approximate Nearest Neighbor Search
- Blog: SIMP: accurate and efficient near neighbor search in high dimensional spaces
- Blog: PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search
- Blog: Exact and/or Fast Nearest Neighbors
- Blog: Locality-Sensitive Hashing without False Negatives for l_p
- Blog: Locality-sensitive Hashing without False Negatives
- Blog: Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
- Blog: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search.
- Blog: Fully Dynamic Algorithms for Chamfer Distance
- Blog: Low-Quality Dimension Reduction and High-Dimensional Approximate Nearest Neighbor
- Blog: SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index
- Blog: PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search
- Blog: Fast Approximate Nearest-Neighbor Search with
- Blog: Optimized Cartesian K-Means
- Blog: Fast k-Nearest Neighbour Search via Prioritized DCI
- Blog: A Novel Clustering Method Based on Adjacent Grids Searching
- Blog: Fast spectral analysis for approximate nearest neighbor search
- Blog: Recurrent Binary Embedding for GPU-Enabled Exhaustive Retrieval from Billion-Scale Semantic Vectors
- Blog: Front Matter
- Blog: Effective and General Distance Computation for Approximate Nearest Neighbor Search
- Blog: Random Binary Search Trees for Approximate Nearest Neighbour Search in Binary Space
- Blog: A new coding-based algorithm for finding closest pair of vectors
- Blog: Approximate Nearest Neighbor Search by Residual Vector Quantization
- Blog: Revisiting k-Nearest Neighbor Graph Construction on High-Dimensional Data : Experiments and Analyses
- Blog: δ-EMG: A Monotonic Graph Index for Approximate Nearest Neighbor Search
- Blog: Entropy based Nearest Neighbor Search in High Dimensions
- Blog: Dynamic Range-Filtering Approximate Nearest Neighbor Search
- Blog: Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
- Blog: Fast Neighborhood Graph Search using Cartesian Concatenation
- Blog: FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search
- Blog: Pattern-based similarity search for microarray data
- Blog: Leveraging Locality and Robustness to Achieve Massively Scalable Gaussian Process Regression
- Blog: Self-taught hashing for fast similarity search
- Blog: Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search
- Blog: Hardness of Approximate Nearest Neighbor Search under L-infinity
- Blog: A Reliable Order-Statistics-Based Approximate Nearest Neighbor Search Algorithm
- Blog: Affinity Preserving Quantization for Hashing: A Vector Quantization Approach to Compact Learn Binary Codes
- Blog: Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
- Blog: Exploring High-dimensional Search Space via Voronoi Graph Traversing
- Blog: Multi-criteria search algorithm: An efficient approximate k-NN algorithm for image retrieval
- Blog: Speeding up Monte Carlo integration: Control neighbors for optimal convergence
- Blog: RPA: a memory-efficient metric-space recall@<italic>R</italic> ANNS index
- Blog: Compact Hash Codes for Efficient Visual Descriptors Retrieval in Large Scale Databases
- Blog: MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L_1
- Blog: Unsupervised Space Partitioning for Nearest Neighbor Search
- Blog: A Note on Graph-Based Nearest Neighbor Search
- Blog: Megaman: Scalable Manifold Learning in Python
- Blog: A new hashing based nearest neighbors selection technique for big datasets
- Blog: Optimal Data-Dependent Hashing for Approximate Near Neighbors
- Blog: CoveringLSH: Locality-Sensitive Hashing without False Negatives
- Blog: Efficient Large-scale Approximate Nearest Neighbor Search on the GPU
- Blog: Toward Metrics for Differentiating Out-of-Distribution Sets
- Blog: Fast, Accurate Manifold Denoising by Tunneling Riemannian Optimization
- Blog: A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search
- Blog: Differentially Private High-Dimensional Approximate Range Counting, Revisited
- Blog: Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors
- Blog: Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan
Showing 60 of 213 papers.
History & citation
Current · Permanent link
- hash table memory optimization split from this direction (69% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_curse_of_dimensionality_high_dimensional_034640c4,
title = {curse of dimensionality (high-dimensional search complexity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/curse-of-dimensionality-high-dimensional-search-complexity/rdr_034640c4e8b148f58fabc57e04d50aff},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_curse_of_dimensionality_high_dimensional_034640c4_v2,
title = {curse of dimensionality (high-dimensional search complexity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/curse-of-dimensionality-high-dimensional-search-complexity/rdr_034640c4e8b148f58fabc57e04d50aff/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}