64 citations · 323 across the 25 of their papers we have counts for
5 papers · 1 filter
Subgraph Pattern Matching over Uncertain Graphs with Identity Linkage Uncertainty
Walaa Eldin Moustafa, Angelika Kimmig, Amol Deshpande +1
There is a growing need for methods which can capture uncertainties and answer queries over graph-structured data. Two common types of uncertainty are uncertainty over the attribut…
On Sharing Private Data with Multiple Non-Colluding Adversaries
Theodoros Rekatsinas, Amol Deshpande, Ashwin Machanavajjhala
We present SPARSI, a theoretical framework for partitioning sensitive data across multiple non-colluding adversaries. Most work in privacy-aware data sharing has considered disclos…
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
Amol Deshpande, Lisa Hellerstein, Devorah Kletenik
Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined…
Data Placement and Replica Selection for Improving Co-location in Distributed Environments
K. Ashwin Kumar, Amol Deshpande, Samir Khuller
Increasing need for large-scale data analytics in a number of application domains has led to a dramatic rise in the number of distributed data management systems, both parallel rel…
Efficient Stepwise Selection in Decomposable Models
Amol Deshpande, Minos Garofalakis, Michael I. Jordan
In this paper, we present an efficient way of performing stepwise selection in the class of decomposable models. The main contribution of the paper is a simple characterization of…