2463 search results - page 56 / 493 » Compressing Pattern Databases |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
STACS
2009
Springer
14 years 2 months ago
2009
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
FQAS
2004
Springer
13 years 11 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...