1464 search results - page 32 / 293 » On optimal anonymization for l -diversity |
154
click to vote
COMBINATORICA
2011
13 years 11 months ago
2011
Let L be a finite distributive lattice and µ : L → R+ a logsupermodular function. For functions k : L → R+ let Eµ(k; q) def = x∈L k(x)µ(x)qrank(x) ∈ R+ [q]. We prove fo...
IFIPTM
2009
14 years 9 months ago
2009
Effective defense against Internet threats requires data on global real time network status. Internet sensor networks provide such real time network data. However, an organization...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— We derive new bounds on the aperiodic total squared correlation (ATSC) of binary antipodal signature sets for any number of signatures K and any signature length L. We then pre...
DAGSTUHL
2004
15 years 1 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
WAOA
2007
Springer
15 years 6 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...