Sciweavers

219 search results - page 37 / 44
» Nearly Private Information Retrieval
Sort
View
FOCS
2010
IEEE
13 years 5 months ago
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis
Abstract--We consider statistical data analysis in the interactive setting. In this setting a trusted curator maintains a database of sensitive information about individual partici...
Moritz Hardt, Guy N. Rothblum
WWW
2010
ACM
14 years 2 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
IMC
2009
ACM
14 years 2 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
LATIN
2010
Springer
14 years 2 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
RECSYS
2009
ACM
14 years 2 months ago
Collaborative prediction and ranking with non-random missing data
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ï¬...
Benjamin M. Marlin, Richard S. Zemel