Sciweavers

84 search results - page 9 / 17
» Anonymizing sequential releases
Sort
View
ICDE
2008
IEEE
219views Database» more  ICDE 2008»
16 years 1 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
CCS
2009
ACM
16 years 8 days ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
VLDB
2005
ACM
136views Database» more  VLDB 2005»
15 years 5 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
15 years 3 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
ISCA
2007
IEEE
162views Hardware» more  ISCA 2007»
15 years 6 months ago
BulkSC: bulk enforcement of sequential consistency
While Sequential Consistency (SC) is the most intuitive memory consistency model and the one most programmers likely assume, current multiprocessors do not support it. Instead, th...
Luis Ceze, James Tuck, Pablo Montesinos, Josep Tor...