Tipo
Paper de conferencia
Año
2012
ISSN
2157-8095
Páginas
1102
Abstract
Autores
Citekey
6283023
doi
10.1109/ISIT.2012.6283023
Keywords
Upper bound
Markov processes
computational complexity
Context
BIC estimator
maximum likelihood estimation
Entropy
KT-based MDL Markov order estimators
PML estimators
asymptotic penalty
cost functions
description length
explicit sequences
individual sequences
input alphabet
penalized maximum likelihood estimators
Electronic mail