995 search results - page 25 / 199 » String Pattern Discovery |
ICDE
2007
IEEE
14 years 1 months ago
2007
IEEE
The search for unknown frequent pattern is one of the core activities in many time series data mining processes. In this paper we present an extension of the pattern discovery pro...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
FUN
2010
Springer
14 years 11 days ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
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 ...