64 citations · 113 across the 6 of their papers we have counts for
6 papers
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…
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…
Efficient Snapshot Retrieval over Historical Graph Data
Udayan Khurana, Amol Deshpande
We address the problem of managing historical data for large evolving information networks like social networks or citation networks, with the goal to enable temporal and evolution…
On Computing Compression Trees for Data Collection in Sensor Networks
Jian Li, Amol Deshpande, Samir Khuller
We address the problem of efficiently gathering correlated data from a wired or a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees,…
Consensus Answers for Queries over Probabilistic Databases
Jian Li, Amol Deshpande
We address the problem of finding a "best" deterministic query answer to a query over a probabilistic database. For this purpose, we propose the notion of a consensus world (or a c…