arXiv (OAI Expanded)
open access
GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
Approximate nearest neighbor search (ANNS) on GPUs is gaining increasing popularity for modern retrieval and recommendation workloads that operate over massive high-dimensional vectors. Graph-based indexes deliver high recall and throughput but incur heavy build-time and storage costs. In contrast,
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
- GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search#785115
- Chimera: Efficient Multi-Vector Retrieval via GPU-CPU Co-Processing#674570
- Doubly Stochastic Adaptive Neighbors Clustering via the Marcus Mapping#923991
- Doubly Stochastic Adaptive Neighbors Clustering via the Marcus Mapping#919762
- GPU-Accelerated Multilevel Graph Clustering: A Parallel Perspective on Louvain and Leiden#423934
Record · ID 783525
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