No article text was recorded for this version.
sublinear retrieval scaling
Version 1 of 128 papers31 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fast Exact Search in Hamming Space With Multi-Index Hashing.
- Blog: Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasets
- Blog: Low-quality dimension reduction and high-dimensional Approximate Nearest Neighbor
- Blog: RAMBO: Repeated And Merged Bloom Filter for Multiple Set Membership Testing (MSMT) in Sub-linear time
- Blog: Scaling Laws for Nearest Neighbor Search
- Blog: Multilinear Hyperplane Hashing
- Blog: Optimal Data-Dependent Hashing for Approximate Near Neighbors
- Blog: Beyond Pairwise: Provably Fast Algorithms for Approximate k-Way Similarity Search
- Blog: High-Dimensional Similarity Query Processing for Data Science
- Blog: Distance-sensitive hashing
- Blog: Similarity Search in High Dimensions via Hashing
- Blog: Phrase-Indexed Question Answering: A New Challenge for Scalable Document Comprehension
- Blog: Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
- Blog: SoftMatcha 2: A Fast and Soft Pattern Matcher for Trillion-Scale Corpora
- Blog: Discriminative Information Retrieval for Question Answering Sentence Selection
- Blog: Efficient Approximation of Edit Distance
- Blog: Scalability and Total Recall with Fast CoveringLSH
- Blog: Probabilistic Polynomials and Hamming Nearest Neighbors
- Blog: Approximate Nearest Subspace Search with Applications to Pattern Recognition
- Blog: Clustering using Approximate Nearest Neighbour Oracles
- Blog: Fast Subspace Search via Grassmannian Based Hashing
- Blog: A general framework for Approximate Nearest Subspace search
- Blog: FANNG: Fast Approximate Nearest Neighbour Graphs
- Blog: Fast Pose Estimation with Parameter-Sensitive Hashing
- Blog: Relevance Proximity Graphs for Fast Relevance Retrieval
- Blog: Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
- Blog: Subquadratic High-Dimensional Hierarchical Clustering
- Blog: Multiscale approximation methods (MAME) to locate embedded consecutive subsequences—its applications in statistical data mining and spatial statistics
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_sublinear_retrieval_scaling_ea3e4f29,
title = {sublinear retrieval scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sublinear-retrieval-scaling/rdr_ea3e4f29283d4a349326efea282aa571},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_sublinear_retrieval_scaling_ea3e4f29_v1,
title = {sublinear retrieval scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sublinear-retrieval-scaling/rdr_ea3e4f29283d4a349326efea282aa571/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}