M. C. Golumbic, "Combinatorial merging," IEEE Transactions on Computers, vol. 25, pp. 1164--1167, Nov. 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Huffman Algebras for Independent Random Variables - Chang, Thomas (Correct)
....lengths p i l i , where p i is the probability of symbol i and l i is the depth of symbol i. The algorithm is a greedy tree building algorithm which constructs a tree from the bottom up recursively by merging the two lowest weights. Various generalizations of the algorithm have since appeared [11, 7, 8, 10, 14, 15, 20]. An important application of the Hu man algorithm is to parallel processing or circuit design. Consider the following problem: Example 1.1 Assume that we are building a circuit out of two input gates of constant delay of 1 clock cycle. Assume that we have signals available at times 1,2,3 and 4 ....
....at the earliest possible time (see the example in the introduction) It is also useful in model of parallel processing where parallel subtasks produce results which have to be combined two at a time. In this case too, we can identify the equivalent of the entropy function. It is shown in Golumbic[8] that J(p) max (p i l i ) J(p) 1; 12) J(p) log 2 m p i : 13) This result can also be derived by taking taking p i = 2 p i log and letting 1 in (9) to obtain the bounds of (12) max; is an AIHA. The optimization problem in this case, is min T ....
M.C. Golumbic. Combinatorial merging. IEEE Trans. Comput., C-25:1164-1167, 1976.
A Fast Algorithm for Area Minimization of Slicing Floorplans - Shi (Correct)
....The space complexity is the same as the time complexity. For more than a decade, Stockmeyer s algorithm has been considered the fastest possible. Note that although one can minimize the depth of some part of the slicing tree if that part contains only vertical slices or only horizontal slices [7], some slicing trees cannot be balanced. If we extend Stockmeyer s algorithm to allow more than two realizations for each basic block, then the running time will be O(n 2 ) if the realizations for the basic blocks are not evenly distributed among the basic blocks. For hierarchical non slicing ....
M. C. Golumbic, "Combinatorial merging," IEEE Trans. on Computers, Vol. C-25, pp 1164--1167, 1976.
Fanout Optimization under a Submicron.. - Cocchini, Pedram.. (Correct)
No context found.
M. C. Golumbic, "Combinatorial merging," IEEE Transactions on Computers, vol. 25, pp. 1164--1167, Nov. 1976.
Dynamic Shannon Coding - Travis Gagie Student (2004) (Correct)
No context found.
M. Golumbic, "Combinatorial merging," IEEE Transactions on Computers, vol. 24, pp. 1164--1167, 1976.
A Fast Algorithm for Area Minimization of Slicing Floorplans - Shi (Correct)
No context found.
M. C. Golumbic, "Combinatorial merging," IEEE Trans. on Computers, Vol. C-25, pp 1164--1167, 1976.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC