33 citations · 122 across the 14 of their papers we have counts for
21 papers
OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries
Shikhar Jaiswal, Ravishankar Krishnaswamy, Ankit Garg +2
State-of-the-art algorithms for Approximate Nearest Neighbor Search (ANNS) such as DiskANN, FAISS-IVF, and HNSW build data dependent indices that offer substantially better accurac…
Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse
Ravishankar Krishnaswamy, Shi Li, Varun Suriyanarayana
We consider the online unrelated-machine load balancing problem with recourse, where the algorithm is allowed to re-assign prior jobs. We give a -competitive algorithm for t…
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
Harsha Vardhan Simhadri, George Williams, Martin Aumüller +9
Despite the broad range of algorithms for Approximate Nearest Neighbor Search, most empirical evaluations of algorithms have focused on smaller datasets, typically of 1 million poi…
Online Discrepancy with Recourse for Vectors and Graphs
Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy +2
The vector-balancing problem is a fundamental problem in discrepancy theory: given T vectors in , find a signing of each vector to minimize the d…
FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy +1
Approximate nearest neighbor search (ANNS) is a fundamental building block in information retrieval with graph-based indices being the current state-of-the-art and widely used in t…
Online Carpooling using Expander Decompositions
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar +1
We consider the online carpooling problem: given vertices, a sequence of edges arrive over time. When an edge arrives at time step , the algorithm must or…