Sciweavers

503 search results - page 68 / 101
» Probabilistic Weighted Automata
Sort
View
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 8 months ago
Simulation vs. Equivalence
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...
Zoltán Ésik, Andreas Maletti
ACL
2010
13 years 6 months ago
Finding Cognate Groups Using Phylogenies
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...
David Hall, Dan Klein
AI
2011
Springer
13 years 3 months ago
SampleSearch: Importance sampling in presence of determinism
The paper focuses on developing effective importance sampling algorithms for mixed probabilistic and deterministic graphical models. The use of importance sampling in such graphi...
Vibhav Gogate, Rina Dechter
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
14 years 3 months ago
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
Jens Oehlerking, Oliver E. Theel
AAAI
2006
13 years 10 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams