Sciweavers

193 search results - page 12 / 39
» Sparseness Achievement in Hidden Markov Models
Sort
View
CGF
2008
125views more  CGF 2008»
13 years 7 months ago
Sparse points matching by combining 3D mesh saliency with statistical descriptors
This paper proposes new methodology for the detection and matching of salient points over several views of an object. The process is composed by three main phases. In the first st...
Umberto Castellani, Marco Cristani, Simone Fantoni...
ICML
2008
IEEE
14 years 8 months ago
A distance model for rhythms
Modeling long-term dependencies in time series has proved very difficult to achieve with traditional machine learning methods. This problem occurs when considering music data. In ...
Douglas Eck, Jean-François Paiement, Samy B...
COLING
2008
13 years 9 months ago
A Syntactic Time-Series Model for Parsing Fluent and Disfluent Speech
This paper describes an incremental approach to parsing transcribed spontaneous speech containing disfluencies with a Hierarchical Hidden Markov Model (HHMM). This model makes use...
Tim Miller, William Schuler
AUSAI
2003
Springer
13 years 11 months ago
Token Identification Using HMM and PPM Models
Hidden markov models (HMMs) and prediction by partial matching models (PPM) have been successfully used in language processing tasks including learning-based token identification. ...
Yingying Wen, Ian H. Witten, Dianhui Wang
ICASSP
2011
IEEE
12 years 11 months ago
Large vocabulary continuous speech recognition with context-dependent DBN-HMMS
The context-independent deep belief network (DBN) hidden Markov model (HMM) hybrid architecture has recently achieved promising results for phone recognition. In this work, we pro...
George E. Dahl, Dong Yu, Li Deng, Alex Acero