4908 search results - page 49 / 982 » On the Complexity of Optimal K-Anonymity |
151
click to vote
EUROGP
2001
Springer
15 years 10 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
196
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
167
click to vote
ICIP
1998
IEEE
16 years 7 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
169
click to vote
CROSSROADS
2007
15 years 6 months ago
2007
We analyze the complexity of the popular PlayStation 2 game, Katamari Damacy. In particular, we prove that playing Katamari Damacy optimally is NP-hard and that it cannot be appro...