Sciweavers

1513 search results - page 70 / 303
» Cryptographic Pattern Matching
Sort
View
PRIB
2009
Springer
15 years 9 months ago
Syntactic Pattern Recognition Using Finite Inductive Strings
A syntactic pattern recognition technique is described based upon a mathematical principle associated with finite sequences of symbols. The technique allows for fast recognition of...
Paul S. Fisher, Howard Fisher, Jinsuk Baek, Cleopa...
TCS
2008
15 years 4 months ago
Lambda calculus with patterns
The -calculus is an extension of the -calculus with a pattern matching facility. The form of the argument of a function can be speci ed and hence -calculus is more convenient than...
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
IFIP
2004
Springer
15 years 9 months ago
Complementing Computational Protocol Analysis with Formal Specifications
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
CONCUR
2010
Springer
15 years 4 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
EUROPAR
2000
Springer
15 years 8 months ago
Automatic SIMD Parallelization of Embedded Applications Based on Pattern Recognition
This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (patter...
Rashindra Manniesing, Ireneusz Karkowski, Henk Cor...