Login / Signup
The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees.
Douglas Stott Parker Jr.
Prasad Ram
Published in:
SIAM J. Comput. (1999)
Keyphrases
</>
convex optimization
binary trees
total variation
convex optimization problems
series parallel
objective function
greedy algorithm
decision trees
computer vision
feature selection
image processing
image classification
image restoration