Sciweavers

796 search results - page 51 / 160
» The Anonymous Subgraph Problem
Sort
View
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
15 years 21 days ago
On randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
Alan M. Frieze, Juan Vera
96
Voted
WWW
2010
ACM
15 years 27 days ago
Anonymizing user profiles for personalized web search
We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web sea...
Yun Zhu, Li Xiong, Christopher Verdery
214
Voted
ICDE
2008
IEEE
219views Database» more  ICDE 2008»
16 years 2 months ago
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
Osman Abul, Francesco Bonchi, Mirco Nanni
GLOBECOM
2009
IEEE
15 years 7 months ago
Anonymous Cardinality Estimation in RFID Systems with Multiple Readers
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
Vahid Shah-Mansouri, Vincent W. S. Wong
ICDCS
2005
IEEE
15 years 6 months ago
Scalable, Server-Passive, User-Anonymous Timed Release Cryptography
We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem wi...
Aldar C.-F. Chan, Ian F. Blake