Sciweavers

206 search results - page 38 / 42
» Regular Expressions into Finite Automata
Sort
View
HICSS
2006
IEEE
114views Biometrics» more  HICSS 2006»
14 years 1 months ago
A Formal Approach towards Assessing the Effectiveness of Anti-Spam Procedures
Spam e-mails have become a serious technological and economic problem. So far we have been reasonably able to resist spam e-mails and use the Internet for regular communication by...
Guido Schryen
ALT
1998
Springer
13 years 11 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
CODES
2010
IEEE
13 years 5 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
13 years 5 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
IANDC
2011
119views more  IANDC 2011»
13 years 2 months ago
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...