3750 search results - page 189 / 750 » Timed Automata Patterns |
181
click to vote
SPIRE
2000
Springer
15 years 10 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
132
click to vote
LREC
2010
15 years 8 months ago
2010
The process engine for pattern recognition and information fusion tasks, the pepr framework, aims to empower the researcher to develop novel solutions in the field of pattern reco...
192
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
204
click to vote
DIS
2009
Springer
16 years 1 months ago
2009
Springer
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
149
click to vote
IRI
2003
IEEE
15 years 11 months ago
2003
IEEE
— The AnyLog pattern models the core knowledge of any Log, as a written record. The Log finds extensive use in the computing industry. The pattern makes it easy to model differen...