3 papers
cs.DB2026
HNSW with Accuracy Guarantees Using Graph Spanners
Minghao Li, Raghav Mittal, Sanjivni Rana +3
Hierarchical Navigable Small World (HNSW) graphs serve as the industry standard due to their logarithmic complexity and strong empirical performance. However, HNSW relies on greedy…
cs.DS2026
Explaining Rankings with Hidden Group Bonuses
Alvin Hong Yao Yan, Suraj Shetiya, Sujoy Bhore +2
Determining a linear utility function that correlates with observed candidate rankings is a foundational problem with applications in domains such as admissions, hiring, and recomm…
cs.DS2026
Random-Access Ranked Retrieval and Similarity Search
Mohsen Dehghankar, Abolfazl Asudeh, Raghav Mittal +2
We extend Random Access, a fundamental operation that enables efficient search and exploration algorithms, to the modern interactive data systems based on Ranked Retrieval and Simi…