{"total":32,"rows":[{"id":"2205.03763","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","created":"2022-05-08","cited_by_count":45,"area":null},{"id":"2111.08566","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search","created":"2021-11-05","cited_by_count":35,"area":null},{"id":"2401.14732","title":"Residual Quantization with Implicit Neural Codebooks","created":"2024-01-26","cited_by_count":25,"area":null},{"id":"2305.04359","title":"ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms","created":"2023-05-07","cited_by_count":24,"area":null},{"id":"2203.08543","title":"Integrating Language Guidance into Vision-based Deep Metric Learning","created":"2022-03-16","cited_by_count":19,"area":null},{"id":"2404.14600","title":"Planning Ahead in Generative Retrieval: Guiding Autoregressive Generation through Simultaneous Decoding","created":"2024-04-22","cited_by_count":19,"area":null},{"id":"2206.14286","title":"TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s","created":"2022-06-28","cited_by_count":18,"area":null},{"id":"2211.12850","title":"OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries","created":"2022-10-22","cited_by_count":15,"area":null},{"id":"2410.19218","title":"Taxonomy-guided Semantic Indexing for Academic Paper Search","created":"2024-10-25","cited_by_count":12,"area":null},{"id":"2308.02752","title":"DeDrift: Robust Similarity Search under Content Drift","created":"2023-08-05","cited_by_count":11,"area":null},{"id":"2303.06210","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","created":"2023-03-10","cited_by_count":10,"area":null},{"id":"2310.03052","title":"Memoria: Resolving Fateful Forgetting Problem through Human-Inspired Memory Architecture","created":"2023-10-04","cited_by_count":8,"area":null},{"id":"2312.05417","title":"ESPN: Memory-Efficient Multi-Vector Information Retrieval","created":"2023-12-09","cited_by_count":8,"area":null},{"id":"2201.05409","title":"Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrieval","created":"2022-01-14","cited_by_count":7,"area":null},{"id":"2411.00970","title":"Incremental IVF Index Maintenance for Streaming Vector Search","created":"2024-11-01","cited_by_count":7,"area":null},{"id":"2401.07119","title":"Curator: Efficient Indexing for Multi-Tenant Vector Databases","created":"2024-01-13","cited_by_count":3,"area":null},{"id":"2505.01538","title":"HONEYBEE: Efficient Role-based Access Control for Vector Databases via Dynamic Partitioning[Technical Report]","created":"2025-05-02","cited_by_count":3,"area":null},{"id":"2210.05521","title":"Hybrid Inverted Index Is a Robust Accelerator for Dense Retrieval","created":"2022-10-11","cited_by_count":2,"area":null},{"id":"2511.15557","title":"B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index","created":"2025-11-19","cited_by_count":2,"area":null},{"id":"2203.02505","title":"ARM 4-BIT PQ: SIMD-based Acceleration for Approximate Nearest Neighbor Search on ARM","created":"2022-03-03","cited_by_count":1,"area":null},{"id":"2501.10479","title":"Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search","created":"2025-01-16","cited_by_count":1,"area":null},{"id":"2506.04790","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","created":"2025-06-05","cited_by_count":1,"area":null},{"id":"2101.11685","title":"CNN with large memory layers","created":"2021-01-27","cited_by_count":0,"area":null},{"id":"2108.11948","title":"SAUCE: Truncated Sparse Document Signature Bit-Vectors for Fast Web-Scale Corpus Expansion","created":"2021-08-26","cited_by_count":0,"area":null},{"id":"2206.12623","title":"Inverted Semantic-Index for Image Retrieval","created":"2022-06-25","cited_by_count":0,"area":null},{"id":"2403.10746","title":"Vector search with small radiuses","created":"2024-03-16","cited_by_count":0,"area":null},{"id":"2410.22233","title":"ContextIQ: A Multimodal Expert-Based Video Retrieval System for Contextual Advertising","created":"2024-10-29","cited_by_count":0,"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":"2511.04073","title":"Learning Filter-Aware Distance Metrics for Nearest Neighbor Search with Multiple Filters","created":"2025-11-06","cited_by_count":0,"area":null},{"id":"2602.03732","title":"Fast-MWEM: Private Data Release in Sublinear Time","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2602.13345","title":"BLUEPRINT Rebuilding a Legacy: Multimodal Retrieval for Complex Engineering Drawings and Documents","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2607.13728","title":"Cluster with Auctions for Vector Search","created":"2026-07-15","cited_by_count":0,"area":null}],"next_cursor":null}