Sciweavers

606 search results - page 21 / 122
» Discrete Time Process Algebra
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Forgetting Counts: Constant Memory Inference for a Dependent Hierarchical Pitman-Yor Process
We propose a novel dependent hierarchical Pitman-Yor process model for discrete data. An incremental Monte Carlo inference procedure for this model is developed. We show that infe...
Nicholas Bartlett, David Pfau, Frank Wood
TCOS
2008
13 years 7 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang
JLP
2006
113views more  JLP 2006»
13 years 7 months ago
Continuity controlled hybrid automata
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...
Jan A. Bergstra, C. A. Middelburg
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
13 years 12 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
SIAMSC
2010
117views more  SIAMSC 2010»
13 years 6 months ago
Least-Squares Finite Element Methods for Quantum Electrodynamics
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...