2127 search results - page 32 / 426 » Computing large matchings fast |
128
click to vote
CORR
2008
Springer
15 years 3 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...
126
click to vote
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
96
Voted
CBMS
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper presents a full process of reconstruction of magnetic resonance images. The first step is to bring theacquired data fromthefrequencydomain,using a FastFourier Transform...
140
click to vote
ACCV
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper proposes a fast method for dense 3-D interpretation to directly estimate a dense map of relative depth and motion from a monocular sequence of images on large ...
131
click to vote
ARITH
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...