1945 search results - page 6 / 389 » Speeding up Serpent |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of...
CAL
2007
13 years 7 months ago
2007
Abstract— Cache Partitioning has been proposed as an interesting alternative to traditional eviction policies of shared cache levels in modern CMP architectures: throughput is im...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperform...
ICASSP
2007
IEEE
14 years 1 months ago
2007
IEEE
Segmentation and tracking methods have been widely explore. However, they are often computationally heavy or require constraining assumptions. We present in this paper a new syste...