{"total":17,"rows":[{"id":"2402.00943","title":"Approximate Nearest Neighbor Search with Window Filters","created":"2024-02-01","cited_by_count":11,"area":null},{"id":"2405.18680","title":"Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits","created":"2024-05-29","cited_by_count":7,"area":null},{"id":"2312.03940","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","created":"2023-12-06","cited_by_count":3,"area":null},{"id":"2402.11354","title":"Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search","created":"2024-02-17","cited_by_count":3,"area":null},{"id":"2406.02891","title":"A Bi-metric Framework for Fast Similarity Search","created":"2024-06-05","cited_by_count":3,"area":null},{"id":"2402.04713","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2502.06163","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2504.20018","title":"MINT: Multi-Vector Search Index Tuning","created":"2025-04-28","cited_by_count":0,"area":null},{"id":"2505.15636","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","created":"2025-05-21","cited_by_count":0,"area":null},{"id":"2506.20584","title":"The kernel of graph indices for vector search","created":"2025-06-25","cited_by_count":0,"area":null},{"id":"2601.01930","title":"MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Search","created":"2026-01-05","cited_by_count":0,"area":null},{"id":"2605.05674","title":"EGA: Adapting Frozen Encoders for Vector Search with Bounded Out-of-Distribution Degradation","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2607.09909","title":"Learning Partition Trees for Nearest Neighbor Search","created":"2026-07-10","cited_by_count":0,"area":null},{"id":"2608.22137","title":"MegaMem: A Retrieval Solution for Ultra-Large Context Windows","created":"2026-08-22","cited_by_count":0,"area":null},{"id":"2608.22141","title":"MEMONDEMAND: A Memory Management System for Large-Scale Enterprise Data","created":"2026-08-22","cited_by_count":0,"area":null},{"id":"2609.02143","title":"A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search","created":"2026-09-02","cited_by_count":0,"area":null},{"id":"2609.36359","title":"Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}