2107 search results - page 158 / 422 » Computing Small Search Numbers in Linear Time |
163
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Mass spectrometry has become the analytical method of choice in metabolomics research. The identification of unknown compounds is the main bottleneck. In addition to t...
199
click to vote
STACS
1992
Springer
15 years 10 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...
145
click to vote
IPPS
2007
IEEE
16 years 20 days ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
162
click to vote
RSA
2002
15 years 6 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
155
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Our objective is to obtain a state-of-the art object category
detector by employing a state-of-the-art image classifier
to search for the object in all possible image subwindows....