Reasoning about RoboCup soccer narratives
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
In this paper we consider a special kind of binary trees where each right edge is associated with a positive number α and each left edge with a positive number β(α ≦ β). Given α, β and the number of nodes n, an optimal tree is one which minimizes the total weighted path length. An algorithm for constructing an optimal tree for given α, β, n is presented, based on which bounds for balances and total weighted path lengths of optimal trees are derived. © 1977 BIT Foundations.
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Charles A Micchelli
Journal of Approximation Theory