430 search results - page 11 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
KDD
1997
ACM
14 years 5 days ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
CPM
1995
Springer
13 years 11 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
WISE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Association rule mining algorithms such as Apriori were originally developed to automatically detect patterns in sales transactions and were later on also successfully ap...