Sciweavers

373 search results - page 48 / 75
» On Markov Chains for Independent Sets
Sort
View
BMCBI
2005
108views more  BMCBI 2005»
13 years 7 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
13 years 7 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
ICASSP
2010
IEEE
13 years 7 months ago
Phone recognition using Restricted Boltzmann Machines
For decades, Hidden Markov Models (HMMs) have been the state-of-the-art technique for acoustic modeling despite their unrealistic independence assumptions and the very limited rep...
Abdel-rahman Mohamed, Geoffrey E. Hinton
ATAL
2007
Springer
14 years 1 months ago
Conditional random fields for activity recognition
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
Douglas L. Vail, Manuela M. Veloso, John D. Laffer...
CVIU
2006
222views more  CVIU 2006»
13 years 7 months ago
Conditional models for contextual human motion recognition
We present algorithms for recognizing human motion in monocular video sequences, based on discriminative Conditional Random Field (CRF) and Maximum Entropy Markov Models (MEMM). E...
Cristian Sminchisescu, Atul Kanaujia, Dimitris N. ...