4908 search results - page 386 / 982 » On the Complexity of Optimal K-Anonymity |
180
Voted
IESA
2007
15 years 8 months ago
2007
Conventional approaches to manage and control security seem to have reached their limits in new complex environments. These environments are open, dynamic, heterogeneous, distribut...
183
click to vote
CCCG
2008
15 years 8 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
223
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
198
click to vote
IJCV
2002
15 years 6 months ago
2002
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
172
Voted
PE
2002
Springer
15 years 6 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...