搜索结果: 1-1 共查到“管理科学与工程 -depth”相关记录1条 . 查询时间(0.109 秒)
This note considers an n-letter alphabet in which the ith letter is accessed with probability p_i. The problem is to design efficient algorithm for constructing near-optimal, depth-constrained Huffman...
