Sciweavers

20 search results - page 1 / 4
» Approximate Privacy: PARs for Set Problems
Sort
View
44
Voted
CORR
2010
Springer
61views Education» more  CORR 2010»
15 years 14 days ago
Approximate Privacy: PARs for Set Problems
Joan Feigenbaum, Aaron D. Jaggard, Michael Schapir...
123
Voted
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 6 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 9 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
107
Voted
SNPD
2007
15 years 1 months ago
Localized Flooding Backbone Construction for Location Privacy in Sensor Networks
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
Yingchang Xiang, Dechang Chen, Xiuzhen Cheng, Kai ...
125
Voted
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
14 years 10 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...