Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
By taking into account the Fisher information and removing an inherent redundancy in earlier two-part codes, a sharper code length as the stochastic complexity and the associated universal process are derived for a class of parametric processes. The main condition required is that the maximum-likelihood estimates satisfy the Central Limit Theorem. The same code length is also obtained from the so-called maximum-likelihood code. © 1996 IEEE.
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Daniel M. Bikel, Vittorio Castelli
ACL 2008
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000