Sciweavers

91 search results - page 4 / 19
» Weak Composite Diffie-Hellman
Sort
View
ICFP
1996
ACM
13 years 11 months ago
A Theory of Weak Bisimulation for Core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
William Ferreira, Matthew Hennessy, Alan Jeffrey
CSL
2010
Springer
13 years 8 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
DLT
2006
13 years 9 months ago
On Weakly Ambiguous Finite Transducers
By weakly ambiguous (finite) transducers we mean those transducers that, although being ambiguous, may be viewed to be at arm's length from unambiguity. We define input-unambi...
Nicolae Santean, Sheng Yu
CCA
2009
Springer
14 years 2 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
ICML
2009
IEEE
14 years 8 months ago
Compositional noisy-logical learning
We describe a new method for learning the conditional probability distribution of a binary-valued variable from labelled training examples. Our proposed Compositional Noisy-Logica...
Alan L. Yuille, Songfeng Zheng