184 search results - page 22 / 37 » A New Algorithm of Constructing the Basis Finite Automaton |
LATA
2010
Springer
14 years 6 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Network Intrusion Detection Systems (NIDS) are more and more important for identifying and preventing the malicious attacks over the network. This paper proposes a novel cost-e...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
AI
1999
Springer
13 years 8 months ago
1999
Springer
Yeap [42] argued that an important basis for computing a cognitive map is the ability to compute and recognise local environments. Although he has demonstrated how such local envi...