Research map / Learning theory and algorithms / Prediction and decision losses
Online Nearest Neighbor Search Using Hamming Weight Trees
Sepehr Eghbali, Hassan Ashtiani, Ladan Tahvildari
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Efficient Nearest Neighbor Search Using Dynamic Programming (TPAMI 2025 · similarity 0.89)
- Weighted distance nearest neighbor condensing (ICML 2024 · similarity 0.88)
- A Bi-metric Framework for Efficient Nearest Neighbor Search (ICML 2026 · similarity 0.87)
- Graph-Based Algorithms for Diverse Similarity Search (ICML 2025 · similarity 0.86)
- Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search (NeurIPS 2025 · similarity 0.85)
- KNN Implementation Details Can Dramatically Change Performance: An Example from Cover Trees (NeurIPS 2026 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
