4908 search results - page 343 / 982 » On the Complexity of Optimal K-Anonymity |
220
click to vote
EC
2000
15 years 6 months ago
2000
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
166
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
196
click to vote
GECCO
2003
Springer
16 years 16 min ago
2003
Springer
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
174
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...