Sciweavers

108 search results - page 2 / 22
» Fast Convolutions and Their Applications in Approximate Stri...
Sort
View
111
Voted
ICIP
2009
IEEE
16 years 4 months ago
Fast Pseudo-enhancement Correction In Ct Colonography Using Linear Shift-invariant Filters
This paper presents a novel method to approximate shiftvariant Gaussian filtering of an image using a set of shiftinvariant Gaussian filters. This approximation affords filtering ...
118
Voted
MST
2006
96views more  MST 2006»
15 years 3 months ago
Juggling with Pattern Matching
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
Jean Cardinal, Steve Kremer, Stefan Langerman
187
Voted
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 8 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
113
Voted
SOFSEM
2005
Springer
15 years 9 months ago
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance
Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara
SPIRE
1998
Springer
15 years 8 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro