Sciweavers

901 search results - page 34 / 181
» On Anonymization of String Data
Sort
View
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
15 years 5 months ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora
ESORICS
2009
Springer
15 years 6 months ago
Privacy Preserving Publication of Moving Object Data
The increasing availability of space-time trajectories left by location-aware devices is expected to enable novel classes of applications where the discovery of consumable, concise...
Francesco Bonchi
SIGMOD
2010
ACM
243views Database» more  SIGMOD 2010»
14 years 12 months ago
Non-homogeneous generalization in privacy preserving data publishing
Most previous research on privacy-preserving data publishing, based on the k-anonymity model, has followed the simplistic approach of homogeneously giving the same generalized val...
Wai Kit Wong, Nikos Mamoulis, David Wai-Lok Cheung
ISCC
2003
IEEE
15 years 5 months ago
Payload analysis of anonymous communication system with host-based rerouting mechanism
Host-based rerouting mechanism is a routing scheme that stores and forwards data in application layer. With this, users can communicate in a indirect way. Thus, identity informati...
Hongfei Sui, Jianer Chen, Songqiao Chen, Jianxin W...
MAGS
2006
79views more  MAGS 2006»
14 years 11 months ago
Utilizing node's selfishness for providing complete anonymity in peer-to-peer based grids
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
Rohit Gupta, Souvik Ray, Arun K. Somani, Zhao Zhan...