216 search results - page 4 / 44 » From Constraints to Finite Automata to Filtering Algorithms |
156
click to vote
ANCS
2007
ACM
15 years 8 months ago
2007
ACM
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
As an example of the recently introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear fi...
136
click to vote
NIPS
2003
15 years 5 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
116
click to vote
IRI
2008
IEEE
15 years 10 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
117
click to vote
ACL
1998
15 years 5 months ago
1998
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...