Folgen
Harsha Vardhan Simhadri
Harsha Vardhan Simhadri
Microsoft Research
Bestätigte E-Mail-Adresse bei microsoft.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Brief announcement: The problem based benchmark suite
J Shun, GE Blelloch, JT Fineman, PB Gibbons, A Kyrola, HV Simhadri, ...
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
2472012
Protonn: Compressed and accurate knn for resource-scarce devices
C Gupta, AS Suggala, A Goyal, HV Simhadri, B Paranjape, A Kumar, ...
International conference on machine learning, 1331-1340, 2017
2002017
DROCC: Deep robust one-class classification
S Goyal, A Raghunathan, M Jain, HV Simhadri, P Jain
International conference on machine learning, 3711-3721, 2020
1662020
Low depth cache-oblivious algorithms
GE Blelloch, PB Gibbons, HV Simhadri
Proceedings of the twenty-second annual ACM symposium on Parallelism in …, 2010
1572010
Rand-nsg: Fast accurate billion-point nearest neighbor search on a single node
SJ Subramanya, D Lnu, HV Simhadri, R Krishnawamy
1392019
Scheduling irregular parallel computations on hierarchical caches
GE Blelloch, JT Fineman, PB Gibbons, HV Simhadri
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
1062011
Towards optimal and efficient perfectly secure message transmission
M Fitzi, M Franklin, J Garay, HV Simhadri
Theory of Cryptography Conference, 2007
952007
Word2Sense: Sparse interpretable word embeddings
A Panigrahi, HV Simhadri, C Bhattacharyya
Proceedings of the 57th annual meeting of the Association for Computational …, 2019
692019
Multiple instance learning for efficient sequential data classification on resource-constrained devices
D Dennis, C Pabbaraju, HV Simhadri, P Jain
Advances in Neural Information Processing Systems 31, 2018
592018
RNNPool: Efficient non-linear pooling for RAM constrained inference
O Saha, A Kusupati, HV Simhadri, M Varma, P Jain
Advances in Neural Information Processing Systems 33, 20473-20484, 2020
552020
Write-avoiding algorithms
E Carson, J Demmel, L Grigori, N Knight, P Koanantakool, O Schwartz, ...
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2016
532016
Parallel and i/o efficient set covering algorithms
GE Blelloch, HV Simhadri, K Tangwongsan
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
532012
Shallow rnn: accurate time-series classification on resource constrained devices
D Dennis, DAE Acar, V Mandikal, VS Sadasivan, V Saligrama, ...
Advances in neural information processing systems 32, 2019
44*2019
EdgeML: Machine Learning for resource-constrained edge devices
DK Dennis, Y Gaurkar, S Gopinath, S Goyal, C Gupta, M Jain, S Jaiswal, ...
URL https://github. com/Microsoft/EdgeML, 2020
392020
Gesturepod: Enabling on-device gesture-based interaction for white cane users
SG Patil, DK Dennis, C Pabbaraju, N Shaheer, HV Simhadri, V Seshadri, ...
Proceedings of the 32nd Annual ACM symposium on User Interface Software and …, 2019
39*2019
Results of the NeurIPS’21 challenge on billion-scale approximate nearest neighbor search
HV Simhadri, G Williams, M Aumüller, M Douze, A Babenko, D Baranchuk, ...
NeurIPS 2021 Competitions and Demonstrations Track, 177-189, 2022
382022
Freshdiskann: A fast and accurate graph-based ann index for streaming similarity search
A Singh, SJ Subramanya, R Krishnaswamy, HV Simhadri
arXiv preprint arXiv:2105.09613, 2021
302021
Experimental analysis of space-bounded schedulers
HV Simhadri, GE Blelloch, JT Fineman, PB Gibbons, A Kyrola
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-27, 2016
252016
Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters
S Gollapudi, N Karia, V Sivashankar, R Krishnaswamy, N Begwani, S Raz, ...
Proceedings of the ACM Web Conference 2023, 3406-3416, 2023
242023
Diskann: Fast accurate billion-point nearest neighbor search on a single node
S Jayaram Subramanya, F Devvrit, HV Simhadri, R Krishnawamy, ...
Advances in Neural Information Processing Systems 32, 2019
242019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20