4908 search results - page 265 / 982 » On the Complexity of Optimal K-Anonymity |
192
click to vote
ARCS
2008
Springer
15 years 8 months ago
2008
Springer
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...
164
click to vote
ASPLOS
2008
ACM
15 years 8 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
198
click to vote
CONEXT
2005
ACM
15 years 8 months ago
2005
ACM
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
178
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...
209
click to vote
CF
2007
ACM
15 years 8 months ago
2007
ACM
In recent years, highly accurate branch predictors have been proposed primarily for high performance processors. Unfortunately such predictors are extremely energy consuming and i...