Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Sarpatwar, Kanthi"'
Autor:
Raykar, Vikas C., Jati, Arindam, Mukherjee, Sumanta, Aggarwal, Nupur, Sarpatwar, Kanthi, Ganapavarapu, Giridhar, Vaculin, Roman
A trustworthy machine learning model should be accurate as well as explainable. Understanding why a model makes a certain decision defines the notion of explainability. While various flavors of explainability have been well-studied in supervised lear
Externí odkaz:
http://arxiv.org/abs/2303.12316
Autor:
Aharoni, Ehud, Baruch, Moran, Bose, Pradip, Buyuktosunoglu, Alper, Drucker, Nir, Pal, Subhankar, Pelleg, Tomer, Sarpatwar, Kanthi, Shaul, Hayim, Soceanu, Omri, Vaculin, Roman
Publikováno v:
In: Tsudik, G., Conti, M., Liang, K., Smaragdakis, G. (eds) Computer Security - ESORICS 2023. ESORICS 2023. Lecture Notes in Computer Science, vol 14347. Springer, Cham
Privacy-preserving machine learning (PPML) solutions are gaining widespread popularity. Among these, many rely on homomorphic encryption (HE) that offers confidentiality of the model and the data, but at the cost of large latency and memory requireme
Externí odkaz:
http://arxiv.org/abs/2207.03384
Autor:
Sarpatwar, Kanthi, Nandakumar, Karthik, Ratha, Nalini, Rayfield, James, Shanmugam, Karthikeyan, Pankanti, Sharath, Vaculin, Roman
Data privacy concerns often prevent the use of cloud-based machine learning services for sensitive personal data. While homomorphic encryption (HE) offers a potential solution by enabling computations on encrypted data, the challenge is to obtain acc
Externí odkaz:
http://arxiv.org/abs/2103.03411
Autor:
Sarpatwar, Kanthi, Shanmugam, Karthikeyan, Ganapavarapu, Venkata Sitaramagiridharganesh, Jagmohan, Ashish, Vaculin, Roman
We envision AI marketplaces to be platforms where consumers, with very less data for a target task, can obtain a relevant model by accessing many private data sources with vast number of data samples. One of the key challenges is to construct a train
Externí odkaz:
http://arxiv.org/abs/1910.12832
We study a variant of the \emph{generalized assignment problem} ({\sf GAP}) with group constraints. An instance of {\sf Group GAP} is a set $I$ of items, partitioned into $L$ groups, and a set of $m$ uniform (unit-sized) bins. Each item $i \in I$ has
Externí odkaz:
http://arxiv.org/abs/1907.01745
We revisit a classical scheduling model to incorporate modern trends in data center networks and cloud services. Addressing some key challenges in the allocation of shared resources to user requests (jobs) in such settings, we consider the following
Externí odkaz:
http://arxiv.org/abs/1811.07413
We present a simple combinatorial $\frac{1 -e^{-2}}{2}$-approximation algorithm for maximizing a monotone submodular function subject to a knapsack and a matroid constraint. This classic problem is known to be hard to approximate within factor better
Externí odkaz:
http://arxiv.org/abs/1705.06319
Autor:
Hajiaghayi, MohammadTaghi, Kortsarz, Guy, MacDavid, Robert, Purohit, Manish, Sarpatwar, Kanthi
An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V, E) and the goal is to find a subset of vertices S $\subseteq$ V that maximizes the number of edges in the cut \delta(S) such that the induced graph G[S] is conne
Externí odkaz:
http://arxiv.org/abs/1507.00648
We study partial and budgeted versions of the well studied connected dominating set problem. In the partial connected dominating set problem, we are given an undirected graph G = (V,E) and an integer n', and the goal is to find a minimum subset of ve
Externí odkaz:
http://arxiv.org/abs/1311.2309
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong)
Externí odkaz:
http://arxiv.org/abs/1105.0979