399 search results - page 5 / 80 » An Automata Approach to Pattern Collections |
SPIRE
2005
Springer
14 years 29 days ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
DKE
2008
13 years 7 months ago
2008
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
ACRI
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Genetic Algorithms have been used before to evolve transition rules for one dimensional Cellular Automata (CA) to solve e.g. the majority problem and investigate communic...
VTS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper presents a BIST architecture for Finite State Machines that exploits Cellular Automata (CA) as pattern generators and signature analyzers. The main advantage of the pro...