Sciweavers

21 search results - page 4 / 5
» Structural hidden Markov models: An application to handwritt...
Sort
View
COLT
1994
Springer
13 years 9 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby
JCB
2006
215views more  JCB 2006»
13 years 5 months ago
Protein Fold Recognition Using Segmentation Conditional Random Fields (SCRFs)
Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation con...
Yan Liu 0002, Jaime G. Carbonell, Peter Weigele, V...
CVPR
1998
IEEE
14 years 7 months ago
Action Recognition Using Probabilistic Parsing
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
Aaron F. Bobick, Yuri A. Ivanov
NN
1997
Springer
174views Neural Networks» more  NN 1997»
13 years 9 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
CORR
2004
Springer
195views Education» more  CORR 2004»
13 years 5 months ago
Detecting User Engagement in Everyday Conversations
This paper presents a novel application of speech emotion recognition: estimation of the level of conversational engagement between users of a voice communication system. We begin...
Chen Yu, Paul M. Aoki, Allison Woodruff