( en | de | ru )

 

Disambiguation of "Krishnaswamy, Ravishankar"

Author of the publication

copydeleteadd this publication to your clipboard
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search.

, , , , , , , , , , , and . NeurIPS (Competition and Demos), volume 176 of Proceedings of Machine Learning Research, page 177-189. PMLR, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arvind Krishnaswamy

Krishnaswamy Kadambi

Nuggehalli Krishnaswamy

Krishnaswamy Krishna Simhan

Jayendra Kumar Krishnaswamy

 

Other publications of authors with the same name

Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search., , , , , , , , , and 2 other author(s). CoRR, (2022)Relax, no need to round: integrality of clustering formulations., , , , , and . CoRR, (2014)Minimum Makespan Scheduling with Low Rank Processing Times., , , and . SODA, page 937-947. SIAM, (2013)Inapproximability of the multi-level uncapacitated facility location problem., and . SODA, page 718-734. SIAM, (2012)Robust Correlation Clustering., , and . APPROX-RANDOM, volume 145 of LIPIcs, page 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse., , and . STOC, page 775-788. ACM, (2023)Online and Stochastic Survivable Network Design., , and . SIAM J. Comput., 41 (6): 1649-1672 (2012)Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits., , , and . FOCS, page 827-836. IEEE Computer Society, (2011)Constant approximation for k-median and k-means with outliers via iterative rounding., , and . STOC, page 646-659. ACM, (2018)Network-wide deployment of intrusion detection and prevention systems., , , and . CoNEXT, page 18. ACM, (2010)