Graph-Based Nearest-Neighbor Search without the Spread

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Giliberti, Jeff, Har-Peled, Sariel, Sauer, Jonas, Vakilian, Ali
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computational Geometry Data Structures and Algorithms Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Approximately: Independence Implies Vertex Cover
di: Har-Peled, Sariel
Pubblicazione: (2023)

Bifurcation: How to Explore a Tree
di: Har-Peled, Sariel
Pubblicazione: (2025)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
di: Diwan, Haya, et al.
Pubblicazione: (2024)

An Easy Proof of a Weak Version of Chernoff inequality
di: Har-Peled, Sariel
Pubblicazione: (2025)

Quickly Avoiding a Random Catastrophe
di: Ashur, Stav, et al.
Pubblicazione: (2025)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
di: Krauthgamer, Robert, et al.
Pubblicazione: (2026)

Adversarially Robust Approximate Furthest Neighbor
di: Banihashem, Kiarash, et al.
Pubblicazione: (2026)

Learning-Based Algorithms for Graph Searching Problems
di: DePavia, Adela Frances, et al.
Pubblicazione: (2024)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
di: Yu, Shangdi, et al.
Pubblicazione: (2023)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
di: Iacono, John, et al.
Pubblicazione: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
di: Herold, Martin G., et al.
Pubblicazione: (2025)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
di: Al-Jazzazi, Yousef, et al.
Pubblicazione: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
di: Mishra, Nina, et al.
Pubblicazione: (2025)

Approximate Nearest Neighbor Search with Window Filters
di: Engels, Joshua, et al.
Pubblicazione: (2024)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
di: Lu, Kejing, et al.
Pubblicazione: (2024)

Hardness of High-Dimensional Linear Classification
di: Munteanu, Alexander, et al.
Pubblicazione: (2026)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
di: Zhang, Guangyi, et al.
Pubblicazione: (2026)

Discovering Data Structures: Nearest Neighbor Search and Beyond
di: Salemohamed, Omar, et al.
Pubblicazione: (2024)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
di: Wang, Jiachen T., et al.
Pubblicazione: (2024)

A Query-Driven Approach to Space-Efficient Range Searching
di: Fotakis, Dimitris, et al.
Pubblicazione: (2025)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
di: Danait, Ved, et al.
Pubblicazione: (2025)

Scalable Algorithms for Individual Preference Stable Clustering
di: Mosenzon, Ron, et al.
Pubblicazione: (2024)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
di: Bruch, Sebastian, et al.
Pubblicazione: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
di: Khanna, Sanjeev, et al.
Pubblicazione: (2025)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
di: Li, Binhong, et al.
Pubblicazione: (2025)

On Socially Fair Low-Rank Approximation and Column Subset Selection
di: Song, Zhao, et al.
Pubblicazione: (2024)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
di: Gudmundsson, Joachim, et al.
Pubblicazione: (2022)

Fast Agnostic Learners in the Plane
di: Eden, Talya, et al.
Pubblicazione: (2025)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
di: Abbasi, Fateme, et al.
Pubblicazione: (2023)

A Tight VC-Dimension Analysis of Clustering Coresets with Applications
di: Cohen-Addad, Vincent, et al.
Pubblicazione: (2025)

Coresets for Clustering Under Stochastic Noise
di: Huang, Lingxiao, et al.
Pubblicazione: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
di: Greenhut, Daniel, et al.
Pubblicazione: (2025)

Coreset for Robust Geometric Median: Eliminating Size Dependency on Outliers
di: Fang, Ziyi, et al.
Pubblicazione: (2025)

Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
di: Krivošija, Amer, et al.
Pubblicazione: (2025)

Terminal Embeddings in Sublinear Time
di: Cherapanamjeri, Yeshwanth, et al.
Pubblicazione: (2021)

Learning the Positions in CountSketch
di: Li, Yi, et al.
Pubblicazione: (2023)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
di: Ma, Xinran, et al.
Pubblicazione: (2025)

Guessing Efficiently for Constrained Subspace Approximation
di: Bhaskara, Aditya, et al.
Pubblicazione: (2025)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
di: Dehghankar, Mohsen, et al.
Pubblicazione: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
di: Andoni, Alexandr, et al.
Pubblicazione: (2026)