134 search results - page 10 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
DATESO
2009
13 years 8 months ago
2009
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
CPM
2008
Springer
14 years 5 days ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
WSDM
2009
ACM
14 years 5 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
CORR
2010
Springer
13 years 10 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...
CISS
2011
IEEE
13 years 2 months ago
2011
IEEE
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...