Given a metric space graph
G
(
V, E
) in which only a subset of edge distances is known, we study a query-based model for answering lower bound distance queries on unknown edges, without access to any black-box distance oracle. For a queried pair of objects (
u, υ
) with unknown distance, the lower bound corres...
Swastika Biswas, Sohrab Namazi Nia, Jees Augustine et al.· Proceedings of the VLDB Endo...· 0 citations
The contribution tree is proposed, a hierarchical framework that conserves importance across the document structure and separates original from citation-derived contribution, and is extended to article collections by propagating contributions through weighted citation graphs, yielding corpus-level contributions and nor...
Sana Ebrahimi, Suraj Shetiya, Abolfazl Asudeh· 0 citations
This paper proposes a novel "Certify-then-Rectify" framework that bridges the gap between the speed of heuristic search and the rigor of exact retrieval, and reinterprets the HNSW graph as a geometric spanner and utilizes Extreme Value Theory to stochastically estimate its maximum empirical stretch factor.
Minghao Li, Raghav Mittal, Sanjivni Rana et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.