Sciweavers

886 search results - page 26 / 178
» On the Autoreducibility of Random Sequences
Sort
View
ICPR
2000
IEEE
14 years 2 days ago
Hidden Markov Random Field Based Approach for Off-Line Handwritten Chinese Character Recognition
This paper presents a Hidden Markov Mesh Random Field (HMMRF) based approach for off-line handwritten Chinese characters recognition using statistical observation sequences embedd...
Qing Wang, Rongchun Zhao, Zheru Chi, David Dagan F...
ACL
2004
13 years 9 months ago
Using Conditional Random Fields to Predict Pitch Accents in Conversational Speech
The detection of prosodic characteristics is an important aspect of both speech synthesis and speech recognition. Correct placement of pitch accents aids in more natural sounding ...
Michelle L. Gregory, Yasemin Altun
SIAMCO
2000
104views more  SIAMCO 2000»
13 years 7 months ago
Law of the Iterated Logarithm for a Constant-Gain Linear Stochastic Gradient Algorithm
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
J. A. Joslin, A. J. Heunis
JMLR
2010
92views more  JMLR 2010»
13 years 2 months ago
Posterior distributions are computable from predictive distributions
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
Cameron E. Freer, Daniel M. Roy
CORR
2007
Springer
101views Education» more  CORR 2007»
13 years 7 months ago
Tracking Stopping Times
— Let {(Xi, Yi)}∞ i=1 be a sequence of pairs of random variables, and let S be a bounded stopping time with respect to {Xi}∞
Urs Niesen, Aslan Tchamkerten, Gregory W. Wornell