Sciweavers

524 search results - page 33 / 105
» ets 2010
Sort
View
IACR
2011
80views more  IACR 2011»
13 years 11 months ago
History-Free Sequential Aggregate Signatures
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion o...
Marc Fischlin, Anja Lehmann, Dominique Schröd...
ENTCS
2006
150views more  ENTCS 2006»
14 years 11 months ago
Causality Versus True-Concurrency
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Sibylle B. Fröschle, Slawomir Lasota
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 12 months ago
An LSB Data Hiding Technique Using Natural Numbers
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1] based on decomposition of ...
Sandipan Dey, Ajith Abraham, Sugata Sanyal
EOR
2006
72views more  EOR 2006»
14 years 11 months ago
Experimental tour-based travel demand models
CT In this paper some experimental sequential models for the simulation of trip-chains are presented; the models have been calibrated on the base of a survey made in a medium-sized...
Demetrio C. Festa, Daniela Condino, Gabriella Mazz...
ENTCS
2010
90views more  ENTCS 2010»
14 years 12 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...