Sciweavers

1537 search results - page 109 / 308
» On sets not belonging to algebras
Sort
View
UAI
2004
14 years 11 months ago
A New Characterization of Probabilities in Bayesian Networks
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...
Lenhart K. Schubert
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 10 months ago
A finiteness structure on resource terms
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
Thomas Ehrhard
CORR
2010
Springer
63views Education» more  CORR 2010»
14 years 10 months ago
Position Analysis of the RRP-3(SS) Multi-Loop Spatial Structure
The paper presents the position analysis of a spatial structure composed of two platforms mutually connected by one RRP and three SS serial kinematic chains, where R, P, and S sta...
Carlo Innocenti, Philippe Wenger
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 10 months ago
Programming an interpreter using molecular dynamics
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
Jan A. Bergstra, C. A. Middelburg
ENTCS
2010
90views more  ENTCS 2010»
14 years 10 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...