4908 search results - page 366 / 982 » On the Complexity of Optimal K-Anonymity |
196
click to vote
CIA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper introduces a formal method to aggregate over basic beliefs, in order to deduce aggregated or complex beliefs as often used in applications. Complex beliefs can...
167
click to vote
APVIS
2008
15 years 8 months ago
2008
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
156
click to vote
CCCG
2008
15 years 8 months ago
2008
In this paper we investigate the Voronoi diagram that is induced by a set of sites in the plane, where each site's precise location is uncertain but is known to be within a p...
152
click to vote
IJIT
2004
15 years 8 months ago
2004
A novel method of learning complex fuzzy decision regions in the n-dimensional feature space is proposed. Through the fuzzy decision regions, a given pattern's class membershi...
173
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...