227 search results - page 35 / 46 » P Systems and Finite Automata |
ACSAC
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper addresses the problem of detecting masquerading, a security attack in which an intruder assumes the identity of a legitimate user. Many approaches based on Hidden Marko...
ECML
2006
Springer
15 years 3 months ago
2006
Springer
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
117
click to vote
FASE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
QEST
2010
IEEE
14 years 9 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...