Kanthi Kiran Sarpatwar
Kanthi Kiran Sarpatwar
IBM T.J. Watson Research Center
Zweryfikowany adres z us.ibm.com - Strona główna
Cytowane przez
Cytowane przez
Blockchain analytics and artificial intelligence
DN Dillenberger, P Novotny, Q Zhang, P Jayachandran, H Gupta, S Hans, ...
IBM Journal of Research and Development 63 (2/3), 5: 1-5: 14, 2019
Analyzing the optimal neighborhood: Algorithms for budgeted and partial connected dominating set problems
S Khuller, M Purohit, KK Sarpatwar
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
Rainbow connectivity: Hardness and tractability
P Ananth, M Nasre, KK Sarpatwar
IARCS Annual Conference on Foundations of Software Technology and …, 2011
Cross-platform scheduling with long-term fairness and platform-specific optimization
KW Hildrum, Z Nabi, V Nagarajan, R Saccone, KK Sarpatwar, R Wagle, ...
US Patent 9,886,306, 2018
Towards enabling trusted artificial intelligence via blockchain
K Sarpatwar, R Vaculin, H Min, G Su, T Heath, G Ganapavarapu, ...
Policy-based autonomic data governance, 137-153, 2019
Constrained submodular maximization via greedy local search
KK Sarpatwar, B Schieber, H Shachnai
Operations Research Letters 47 (1), 1-6, 2019
Online resource allocation with matching constraints
J Dickerson, K Sankararaman, K Sarpatwar, A Srinivasan, KL Wu, P Xu
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2019
Approximation algorithms for connected maximum cut and related problems
MT Hajiaghayi, G Kortsarz, R MacDavid, M Purohit, K Sarpatwar
Algorithms-ESA 2015, 693-704, 2015
Blockchain enabled AI marketplace: The price you pay for trust
K Sarpatwar, V Sitaramagiridharganesh Ganapavarapu, K Shanmugam, ...
Proceedings of the IEEE/CVF conference on computer vision and pattern …, 2019
The X-flex cross-platform scheduler: who's the fairest of them all?
J Wolf, Z Nabi, V Nagarajan, R Saccone, R Wagle, K Hildrum, E Pring, ...
Proceedings of the Middleware Industry Track, 1-7, 2014
Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
S Khuller, M Purohit, KK Sarpatwar
SIAM Journal on Discrete Mathematics 34 (1), 251-270, 2020
Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice.
P Xu, A Srinivasan, KK Sarpatwar, KL Wu
AAMAS, 1763-1765, 2017
Differentially private distributed data summarization under covariate shift
K Sarpatwar, K Shanmugam, VS Ganapavarapu, A Jagmohan, R Vaculin
Advances in Neural Information Processing Systems 32, 2019
On maximum leaf trees and connections to connected maximum cut problems
R Gandhi, MT Hajiaghayi, G Kortsarz, M Purohit, K Sarpatwar
Information Processing Letters 129, 31-34, 2018
New approximation results for resource replication problems
S Khuller, B Saha, KK Sarpatwar
Algorithmica 74 (3), 969-991, 2016
Efficient encrypted inference on ensembles of decision trees
K Sarpatwar, K Nandakumar, N Ratha, J Rayfield, K Shanmugam, ...
arXiv preprint arXiv:2103.03411, 2021
Privacy enhanced decision tree inference
K Sarpatwar, NK Ratha, K Nandakumar, K Shanmugam, JT Rayfield, ...
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2020
Generalized assignment via submodular optimization with reserved capacity
A Kulik, K Sarpatwar, B Schieber, H Shachnai
arXiv preprint arXiv:1907.01745, 2019
Generalized assignment of time-sensitive item groups
K Sarpatwar, B Schieber, H Shachnai
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018
Efficient unsupervised anomaly detection on homomorphically encrypted data
K Sarpatwar, VS Ganapavarapu, S Sathe, R Vaculin
US Patent 11,271,958, 2022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20