No article text was recorded for this version.
high-dimensional distance computation overhead
Version 1 of 179 papers84 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Indexing expensive functions for efficient multi-dimensional similarity search
- Blog: AlayaLaser: Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search
- Blog: Marigold: Efficient k-means Clustering in High Dimensions
- Blog: Grid-Index Algorithm for Reverse Rank Queries
- Blog: General and Practical Tuning Method for Off-the-Shelf Graph-Based Index: SISAP Indexing Challenge Report by Team UTokyo
- Blog: Sparse Metric Learning via Smooth Optimization
- Blog: Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups
- Blog: Pattern Spotting and Image Retrieval in Historical Documents using Deep Hashing
- Blog: NEWMA: a new method for scalable model-free online change-point detection
- Blog: VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search
- Blog: An Improved Hierarchical Datastructure for Nearest Neighbor Search
- Blog: Faster Linear Algebra for Distance Matrices
- Blog: Fast High-dimensional Kernel Summations Using the Monte Carlo Multipole Method
- Blog: Compressed K-Means for Large-Scale Clustering
- Blog: Möbius Transformation for Fast Inner Product Search on Graph
- Blog: Multi-population opinion dynamics model
- Blog: Supporting Queries with Imprecise Constraints
- Blog: A Unified Approach Towards Active Learning and Out-of-Distribution Detection
- Blog: Improving Bilayer Product Quantization for Billion-Scale Approximate Nearest Neighbors in High Dimensions
- Blog: Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
- Blog: DC4L: Distribution shift recovery via data-driven control for deep learning models
- Blog: Efficient learning with projected histograms
- Blog: Random Projections for $k$-means Clustering
- Blog: Learning Instance Specific Distance for Multi-Instance Classification
- Blog: Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering
- Blog: Adaptive Access Control Applied to Ethernet Data
- Blog: Fast and Large-scale Unsupervised Relation Extraction
- Blog: HiTSEE KNIME: a visualization tool for hit selection and analysis in high-throughput screening experiments for the KNIME platform
- Blog: Discrete profile alignment via constrained information bottleneck
- Blog: Speeding up Word Mover's Distance and its variants via properties of distances between embeddings
- Blog: Improving the Effectiveness and Efficiency of Stochastic Neighbour Embedding with Isolation Kernel
- Blog: Sampling Techniques for Kernel Methods
- Blog: A Distance Measure for Privacy-preserving Process Mining based on Feature Learning
- Blog: PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors
- Blog: Estimating Density Models with Truncation Boundaries using Score Matching
- Blog: SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
- Blog: TOP: A Framework for Enabling Algorithmic Optimizations for Distance-Related Problems
- Blog: Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections
- Blog: Speed up linear scan in high-dimensions by sorting one-dimensional projections
- Blog: Improving Adaptable Similarity Query Processing by Using Approximations
- Blog: Convergent Bounds on the Euclidean Distance
- Blog: Fast Distance-Based Anomaly Detection in Images Using an Inception-Like Autoencoder
- Blog: VarDrop: Enhancing Training Efficiency by Reducing Variate Redundancy in Periodic Time Series Forecasting
- Blog: Scalability and Total Recall with Fast CoveringLSH
- Blog: A Novel Intrusion Detection Method
- Blog: TC-DTW: Accelerating Multivariate Dynamic Time Warping Through Triangle Inequality and Point Clustering
- Blog: Exact Weighted Minwise Hashing in Constant Time
- Blog: Classifying real-world data with the DDα-procedure
- Blog: Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation
- Blog: Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts
- Blog: Neighbourhood Approximation Forests
- Blog: Dimensionality-Reduction Techniques for Approximate Nearest Neighbor Search: A Survey and Evaluation
- Blog: The Ni1000: High Speed Parallel VLSI for Implementing Multilayer Perceptrons
- Blog: A Better k-means++ Algorithm via Local Search
- Blog: Seed-Based Biclustering of Gene Expression Data
- Blog: ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions
- Blog: Highly-Economized Multi-view Binary Compression for Scalable Image Clustering
- Blog: Kanerva's Sparse Distributed Memory: An Object-Oriented Implementation on the Connection Machine
- Blog: HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search
- Blog: Single versus Multiple Sorting in All Pairs Similarity Search
Showing 60 of 79 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_high_dimensional_distance_computation_ov_5c6c6740,
title = {high-dimensional distance computation overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-dimensional-distance-computation-overhead/rdr_5c6c674065834c4285e6c85b368099de},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_high_dimensional_distance_computation_ov_5c6c6740_v1,
title = {high-dimensional distance computation overhead},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-dimensional-distance-computation-overhead/rdr_5c6c674065834c4285e6c85b368099de/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}