Sciweavers

2137 search results - page 172 / 428
» Proving Abstract Non-interference
Sort
View
MFCS
2010
Springer
15 years 1 months ago
Robust Computations with Dynamical Systems
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
Olivier Bournez, Daniel S. Graça, Emmanuel ...
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 1 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 3 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
MICCAI
2003
Springer
16 years 4 months ago
Disease-Oriented Evaluation of Dual-Bootstrap Retinal Image Registration
Abstract. This paper presents a disease-oriented evaluation of two recent retinal image registration algorithms, one for aligning pairs of retinal images and one for simultaneously...
Chia-Ling Tsai, Anna Majerovics, Charles V. Stewar...
ICML
2007
IEEE
16 years 4 months ago
Incremental Bayesian networks for structure prediction
We propose a class of graphical models appropriate for structure prediction problems where the model structure is a function of the output structure. Incremental Sigmoid Belief Ne...
Ivan Titov, James Henderson