Approximating discrete probability distributions with dependence trees
暂无分享,去创建一个
C. N. Liu | C. K. Chow | C. N. Liu | C. Chow | Chao-Ming Liu
[1] R. A. Leibler,et al. On Information and Sufficiency , 1951 .
[2] H. Trent. A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH. , 1954, Proceedings of the National Academy of Sciences of the United States of America.
[3] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[4] Philip M. Lewis,et al. Approximating Probability Distributions to Reduce Storage Requirements , 1959, Information and Control.
[5] David T. Brown,et al. A Note on Approximations to Discrete Probability Distributions , 1959, Inf. Control..
[6] C. K. Chow,et al. An approach to structure adaptation in pattern recognition , 1966 .
[7] C. Chow. A class of nonlinear recognition procedures , 1966 .
[8] George Nagy,et al. An Experimental Study of Machine Recognition of Hand-Printed Numerals , 1968, IEEE Trans. Syst. Sci. Cybern..