Sciweavers

33 search results - page 6 / 7
» From Mtl to Deterministic Timed Automata
Sort
View
IANDC
2007
152views more  IANDC 2007»
13 years 6 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
FUIN
2007
114views more  FUIN 2007»
13 years 6 months ago
Cellular Devices and Unary Languages
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
Andreas Klein, Martin Kutrib
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 5 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
AAAI
2006
13 years 7 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 19 days ago
A Novel Algorithm and Architecture for High Speed Pattern Matching in Resource-Limited Silicon Solution
— 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...
Nen-Fu Huang, Yen-Ming Chu, Chi-Hung Tsai, Chen-Yi...