2570 search results - page 83 / 514 » Fast Algorithms For The Computation Of Ranklets |
FSE
1997
Springer
15 years 2 months ago
1997
Springer
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
107
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
102
click to vote
WWW
2003
ACM
15 years 10 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
DAC
2006
ACM
15 years 11 months ago
2006
ACM
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...