arXiv (All)
open access
Index-Free Dynamic Edge Retrieval with Energy-Tail-Aware Partial Scans
Dynamic maximum inner-product search (MIPS) returns the $K$ stored vectors with the largest dot products with a query while allowing the dataset to change through insertions, replacements, and deletions. For edge retrieval, the challenge is to achieve high recall and fast queries without making upda
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
- RAVE completeness#934083
- Race, Exchange, Improve: Finding high-quality MIP solutions quickly#973569
- VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton#1049761
- Rational gluing in edge replacement systems#350706
- Feature Bagging Provides Stability#411052
Record · ID 822244
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