arXiv (All)
open access
The Geometry of Hierarchical Navigation: Accuracy and Query Cost for Point Process Input
Large-scale information retrieval systems, including retrieval-augmented generation (RAG) and recommendation engines, widely use multi-layered hierarchical data structures for ultra-fast approximate nearest-neighbor search in high-dimensional vector spaces. However, the geometric conditions that ens
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
- CertEx: Exact Visual Retrieval at Scale by Certified Exclusion#1356661
- PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric\n Space#7143
- Co-occurrence-Aware Quadratic Assignment for Local Feature Matching in Simultaneous Localization and Mapping#1011620
- Unsupervised Data-Efficient Cross-Modal Retrieval with Global-Neighborhood Alignment Hashing#635889
- Unsupervised Data-Efficient Cross-Modal Retrieval with Global-Neighborhood Alignment Hashing#633540
Record · ID 1249736
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