Sciweavers

1855 search results - page 166 / 371
» Probabilistic Frame-Based Systems
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou
ESORICS
2002
Springer
16 years 6 months ago
Confidentiality-Preserving Refinement is Compositional - Sometimes
Confidentiality-preserving refinement describes a relation between a specification and an implementation that ensures that all confidentiality properties required in the specificat...
Thomas Santen, Maritta Heisel, Andreas Pfitzmann
SSS
2009
Springer
16 years 29 days ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra
FSTTCS
2007
Springer
16 years 17 days ago
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables that hold secret data to variables that hold public data. In this work we...
Judicaël Courant, Cristian Ene, Yassine Lakhn...
CORR
2009
Springer
242views Education» more  CORR 2009»
15 years 4 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...