Database
aa108.txt
Associated article: Memory-Efficient Adaptive Huffman Coding
Tags: Database
Published source code accompanying the column by Steven Pigeon and Yoshua Bengio in which they explain how they updated Huffman's classic compression technique. Also see AA108.ZIP.
Algorithm Alley
by Steven Pigeon and Yoshua Bengio
Example 1:
Procedure Update_M(a : symbol)
{
q,p :pointers to leaves ;
p = find(a) ; // Leaf/set containing a
q = find(p's frequency + 1) ; // where to migrate ?
if (q != NIL) { // somewhere to migrate?
remove ...


