Sciweavers

153 search results - page 26 / 31
» Learning a Continuous Hidden Variable Model for Binary Data
Sort
View
ACL
2008
13 years 9 months ago
Sentence Simplification for Semantic Role Labeling
Parse-tree paths are commonly used to incorporate information from syntactic parses into NLP systems. These systems typically treat the paths as atomic (or nearly atomic) features...
David Vickrey, Daphne Koller
ICPR
2006
IEEE
14 years 8 months ago
Mixture of Support Vector Machines for HMM based Speech Recognition
Speech recognition is usually based on Hidden Markov Models (HMMs), which represent the temporal dynamics of speech very efficiently, and Gaussian mixture models, which do non-opt...
Sven E. Krüger, Martin Schafföner, Marce...
RECOMB
2005
Springer
14 years 7 months ago
The Factor Graph Network Model for Biological Systems
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
BMCBI
2010
229views more  BMCBI 2010»
13 years 7 months ago
Mocapy++ - A toolkit for inference and learning in dynamic Bayesian networks
Background: Mocapy++ is a toolkit for parameter learning and inference in dynamic Bayesian networks (DBNs). It supports a wide range of DBN architectures and probability distribut...
Martin Paluszewski, Thomas Hamelryck
FM
2001
Springer
108views Formal Methods» more  FM 2001»
14 years 18 hour ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer