Sciweavers

1199 search results - page 182 / 240
» How to Compare the Power of Computational Models
Sort
View
ICALP
2005
Springer
15 years 12 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
ARCS
2004
Springer
15 years 10 months ago
A Note on Certificate Path Verification in Next Generation Mobile Communications
Abstract. Certificate-based authentication of parties provides a powerful means for verifying claimed identities, since communicating partners do not have to exchange secrets in ad...
Matthias Enzmann, Elli Giessler, Michael Haisch, B...
CASES
2006
ACM
15 years 10 months ago
Incremental elaboration for run-time reconfigurable hardware designs
We present a new technique for compiling run-time reconfigurable hardware designs. Run-time reconfigurable embedded systems can deliver promising benefits over implementations in ...
Arran Derbyshire, Tobias Becker, Wayne Luk
FLOPS
2006
Springer
15 years 10 months ago
Crossing State Lines: Adapting Object-Oriented Frameworks to Functional Reactive Languages
Functional reactive programming integrates dynamic dataflow with functional programming to offer an elegant and powerful model for expressing computations over time-varying values....
Daniel Ignatoff, Gregory H. Cooper, Shriram Krishn...
AIPS
2009
15 years 7 months ago
A Decision-Theoretic Approach to Dynamic Sensor Selection in Camera Networks
Nowadays many urban areas have been equipped with networks of surveillance cameras, which can be used for automatic localization and tracking of people. However, given the large r...
Matthijs T. J. Spaan, Pedro U. Lima