2899 search results - page 245 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
187
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
187
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
The complexity and physical distribution of modern active-safety automotive applications requires the use of distributed architectures. These architectures consist of multiple ele...
176
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
163
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
184
click to vote
CGO
2009
IEEE
16 years 1 months ago
2009
IEEE
Recent work has shown that machine learning can automate and in some cases outperform hand crafted compiler optimizations. Central to such an approach is that machine learning tec...