arXiv (All)
open access
Approximate Nearest Neighbor in Ultra-High Dimensional $\ell_\infty$
We study the approximate nearest neighbor problem under $\ell_\infty$ in the ultra-high dimensional setting where the dimension $d$ is significantly larger than the number of points $n$. Thus, we desire data structures with no dependence on $d$ in the query time. [Herold-Nanongkai-Spoerhase-Varma-Wu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Approximations for the number of maxima and near-maxima in independent data#128384
- Sparse Priors for Efficient Distribution Learning#1034857
- Repeated averaging on expanders I: random $d$-regular graph#1061363
- Poisson-Corrector Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling#1070083
- Weak Private Information Retrieval for Graph-based Storage#394315
Record · ID 987175
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive