arXiv (All)
open access
Grant: A Framework for Approximate Nearest Neighbor Search with Multi-Attribute Range Filters
Recently, academia and industry have considered the problem of approximate nearest neighbor search (ANNS) with filters. In this setting, each object consists of a high-dimensional vector and attribute values. Given a query vector, filters for attribute values, and $k$, this problem retrieves $k$ vec
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
- Grant: A Framework for Approximate Nearest Neighbor Search with Multi-Attribute Range Filters#1257975
- Multi-label feature selection based on binary hashing learning and dynamic graph constraints#153038
- Local Search for Fair Max-Min Diversification#1131714
- When One Point Is Not Enough: Addressing Ambiguous Instances in Dimensionality Reduction by Splitting#222617
- Partially Identified Rankings from Pairwise Interactions#1070661
Record · ID 1248843
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