4908 search results - page 389 / 982 » On the Complexity of Optimal K-Anonymity |
147
click to vote
SBACPAD
2005
IEEE
16 years 13 days ago
2005
IEEE
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...
195
click to vote
SDMW
2004
Springer
16 years 6 days ago
2004
Springer
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...
189
click to vote
ICIP
2003
IEEE
16 years 4 days ago
2003
IEEE
We propose a new algorithm for the real-time control of an interframe video coder operating with a variable rate channel such as wireless channels or the Internet. Using technique...
190
click to vote
TPCG
2003
IEEE
16 years 3 days ago
2003
IEEE
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
174
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...