Sciweavers

185 search results - page 8 / 37
» Efficiently computing private recommendations
Sort
View
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 7 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
KDD
2008
ACM
199views Data Mining» more  KDD 2008»
14 years 7 months ago
Efficient computation of personal aggregate queries on blogs
There is an exploding amount of user-generated content on the Web due to the emergence of "Web 2.0" services, such as Blogger, MySpace, Flickr, and del.icio.us. The part...
Ka Cheung Sia, Junghoo Cho, Yun Chi, Belle L. Tsen...
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 7 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
MICRO
2008
IEEE
118views Hardware» more  MICRO 2008»
14 years 1 months ago
Notary: Hardware techniques to enhance signatures
Hardware signatures have been recently proposed as an efficient mechanism to detect conflicts amongst concurrently running transactions in transactional memory systems (e.g., Bulk...
Luke Yen, Stark C. Draper, Mark D. Hill
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 4 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...