Sciweavers

148 search results - page 2 / 30
» Fast Data Anonymization with Low Information Loss
Sort
View
COMAD
2008
13 years 6 months ago
Ambiguity: Hide the Presence of Individuals and Their Privacy with Low Information Loss
Publishing a database instance containing individual information poses two kinds of privacy risk: presence leakage, by which the attackers can explicitly identify individuals in (...
Hui Wang
ICIP
2002
IEEE
14 years 7 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
PAKDD
2010
ACM
275views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Anonymizing Transaction Data by Integrating Suppression and Generalization
Abstract. Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique i...
Junqiang Liu, Ke Wang
DASFAA
2011
IEEE
341views Database» more  DASFAA 2011»
13 years 3 months ago
Utility-Oriented K-Anonymization on Social Networks
\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
Yazhe WANG, Long XIE, Baihua ZHENG, and Ken C. K. ...
EDBT
2009
ACM
195views Database» more  EDBT 2009»
14 years 4 days ago
Anonymizing moving objects: how to hide a MOB in a crowd?
Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful i...
Roman Yarovoy, Francesco Bonchi, Laks V. S. Lakshm...