99 search results - page 6 / 20 » Speeding Up Pattern Matching by Text Compression |
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
SPIRE
2001
Springer
15 years 1 months ago
2001
Springer
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Prominent feature point descriptors such as SIFT and
SURF allow reliable real-time matching but at a compu-
tational cost that limits the number of points that can be
handled on...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper proposes a hybrid approximate pattern matching/ transform-based compression engine. The idea is to use regular video interframe prediction as a pattern matching algorit...