959 search results - page 61 / 192 » New Techniques for Algorithm Portfolio Design |
127
click to vote
NIPS
2008
15 years 1 months ago
2008
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
100
click to vote
CSCWD
2001
Springer
15 years 4 months ago
2001
Springer
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...
DAC
2005
ACM
15 years 1 months ago
2005
ACM
Traditional corner analysis fails to guarantee a target yield for a given performance metric. However, recently proposed solutions, in the form of statistical timing analysis, whi...
106
click to vote
TC
2008
14 years 11 months ago
2008
Recent studies have shown that, in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
CEE
2007
14 years 12 months ago
2007
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...