Sciweavers

9209 search results - page 99 / 1842
» Data Space Randomization
Sort
View
JCSS
2006
89views more  JCSS 2006»
15 years 2 months ago
Ramsey-type theorems for metric spaces with applications to online problems
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
Yair Bartal, Béla Bollobás, Manor Me...
148
Voted
ICDM
2003
IEEE
142views Data Mining» more  ICDM 2003»
15 years 8 months ago
Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques
Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers base...
Huseyin Polat, Wenliang Du
101
Voted
ICALP
2010
Springer
15 years 18 days ago
Metrical Task Systems and the k-Server Problem on HSTs
Abstract. We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cot
Nikhil Bansal, Niv Buchbinder, Joseph Naor
120
Voted
ACSAC
2009
IEEE
15 years 9 months ago
Privacy through Noise: A Design Space for Private Identification
To protect privacy in large systems, users must be able to authenticate against a central server without disclosing their identity to the network. Private identification protocols ...
Karsten Nohl, David Evans
122
Voted
STACS
2007
Springer
15 years 8 months ago
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
Costas Busch, Srikanta Tirthapura