Sciweavers

945 search results - page 17 / 189
» On the robustness of primitive words
Sort
View
CONCUR
2005
Springer
15 years 11 months ago
Timed Spi-Calculus with Types for Secrecy and Authenticity
Abstract. We present a discretely timed spi-calculus. A primitive for key compromise allows us to model key compromise attacks, thus going beyond the standard Dolev–Yao attacker ...
Christian Haack, Alan Jeffrey
GREC
2007
Springer
15 years 10 months ago
ARG Based on Arcs and Segments to Improve the Symbol Recognition by Genetic Algorithm
In this paper a genetic matching scheme is extended to take into account primitive arcs and complex description in the pattern recognition process. Classical ways only focus on seg...
J.-P. Salmon, Laurent Wendling
RSA
2010
94views more  RSA 2010»
15 years 4 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
CVPR
2006
IEEE
16 years 8 months ago
Automatic Discovery of Action Taxonomies from Multiple Views
We present a new method for segmenting actions into primitives and classifying them into a hierarchy of action classes. Our scheme learns action classes in an unsupervised manner ...
Daniel Weinland, Rémi Ronfard, Edmond Boyer
IFIP
2004
Springer
15 years 11 months ago
Pattern-Matching Spi-Calculus
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
Christian Haack, Alan Jeffrey