Sciweavers

2899 search results - page 488 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
FOCS
1999
IEEE
15 years 5 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
LCPC
1997
Springer
15 years 5 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
DAC
2007
ACM
15 years 5 months ago
Side-Channel Attack Pitfalls
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
Kris Tiri
ICCBR
2007
Springer
15 years 5 months ago
When Similar Problems Don't Have Similar Solutions
The performance of a Case-Based Reasoning system relies on the integrity of its case base but in real life applications the available data used to construct the case base invariabl...
Stewart Massie, Susan Craw, Nirmalie Wiratunga
ESTIMEDIA
2006
Springer
15 years 5 months ago
Loop Nest Splitting for WCET-Optimization and Predictability Improvement
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...
Heiko Falk, Martin Schwarzer