2020 search results - page 5 / 404 » Speeding up Slicing |
ICPR
2002
IEEE
15 years 10 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
14 years 9 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...
110
click to vote
STACS
1992
Springer
15 years 1 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...
103
click to vote
ECCV
2006
Springer
15 years 11 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...
151
click to vote
ICASSP
2007
IEEE
15 years 3 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...