Sciweavers

1923 search results - page 167 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ACL
1994
14 years 11 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
GRID
2006
Springer
14 years 10 months ago
Campus Grids Meet Applications: Modeling, Metascheduling and Integration
Air Quality Forecasting (AQF) is a new discipline that attempts to reliably predict atmospheric pollution. An AQF application has complex workflows and in order to produce timely ...
Yonghong Yan, Barbara M. Chapman
CONCUR
2004
Springer
15 years 3 months ago
Model Checking Restricted Sets of Timed Paths
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
Nicolas Markey, Jean-François Raskin
CRYPTO
2010
Springer
201views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
Protecting Cryptographic Keys against Continual Leakage
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...
Ali Juma, Yevgeniy Vahlis
GI
2004
Springer
15 years 3 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner