Sciweavers

1464 search results - page 10 / 293
» On optimal anonymization for l -diversity
Sort
View
ICDM
2006
IEEE
127views Data Mining» more  ICDM 2006»
15 years 5 months ago
Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
Tiancheng Li, Ninghui Li
SIROCCO
1998
15 years 1 months ago
Time and Bit Optimal Broadcasting on Anonymous Unoriented Hypercubes
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
Stefan Dobrev, Peter Ruzicka, Gerard Tel
ICPR
2008
IEEE
16 years 28 days ago
Bregman distance to L1 regularized logistic regression
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...
Mithun Das Gupta, Thomas S. Huang
IPPS
2006
IEEE
15 years 5 months ago
Achieving strong scaling with NAMD on Blue Gene/L
NAMD is a scalable molecular dynamics application, which has demonstrated its performance on several parallel computer architectures. Strong scaling is necessary for molecular dyn...
Sameer Kumar, Chao Huang, George Almási, La...
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 4 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang