Sciweavers

1243 search results - page 78 / 249
» Reduced-Rank Hidden Markov Models
Sort
View
DMSN
2008
ACM
15 years 6 months ago
Probabilistic processing of interval-valued sensor data
When dealing with sensors with different time resolutions, it is desirable to model a sensor reading as pertaining to a time interval rather than a unit of time. We introduce two ...
Sander Evers, Maarten M. Fokkinga, Peter M. G. Ape...
299
Voted
ICDAR
2011
IEEE
14 years 4 months ago
HMM-Based Alignment of Inaccurate Transcriptions for Historical Documents
—For historical documents, available transcriptions typically are inaccurate when compared with the scanned document images. Not only the position of the words and sentences are ...
Andreas Fischer, Emanuel Indermühle, Volkmar ...
127
Voted
NIPS
1994
15 years 5 months ago
An Input Output HMM Architecture
We introduce a recurrent architecture having a modular structure and we formulate a training procedure based on the EM algorithm. The resulting model has similarities to hidden Ma...
Yoshua Bengio, Paolo Frasconi
ICDAR
2009
IEEE
15 years 2 months ago
HMM-Based Online Recognition of Handwritten Chemical Symbols
In this paper, we present an online handwritten recognition method for Chemical Symbols, a widely used symbol in education and academic interactions. This method is based on Hidde...
Yang Zhang, Guangshun Shi, Jufeng Yang
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 2 months ago
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
Michal Nánási, Tomás Vinar, B...