4908 search results - page 62 / 982 » On the Complexity of Optimal K-Anonymity |
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
169
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
156
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
172
click to vote
SSD
2001
Springer
15 years 10 months ago
2001
Springer
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
148
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...