430 search results - page 8 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
130
click to vote
CIARP
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
127
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
136
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
130
click to vote
PVLDB
2010
15 years 1 months ago
2010
Current pattern-detection proposals for streaming data recognize the need to move beyond a simple regular-expression model over strictly ordered input. We continue in this directi...
216
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...