Huffman tree data structure supports O(log n) sampling and modification of categorical distributions.
Dynamic huffman coding
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient algorithms for modifying and sampling from a categorical distribution
Huffman tree data structure supports O(log n) sampling and modification of categorical distributions.