Title of article :
THE CONSTRUCTION OF HUFFMAN CODES IS A SUBMODULAR ("CONVEX") OPTIMIZATION PROBLEM OVER A LATTICE OF BINARY TREES
Author/Authors :
PARKER، D. STOTT نويسنده , , RAM، PRASAD نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Pages :
-1874
From page :
1875
To page :
0
Abstract :
This paper describes the potential suitability of a new family of concrete mixtures for use in protective structures. Two very-high-strength concrete mixtures are discussed and experimental results of penetration studies on one of these are presented. The results are compared to penetration-study results of other, more conventional concrete mixtures, and the advantages of the very-high-strength mixtures are described.
Keywords :
combinatorial inequalities , quadrangle inequality , enumeration of trees , Fortuin-Kasteleyn-Ginibre(FKG) inequality , prefix codes , greedy algorithms , combinatorial optimization , Entropy , tree imbalance , lattices , submodular functions , majorization , Schur convex functions , adaptive coding , Dynamic Programming , Moebius inversion , Huffman coding , Monge matrices , Convexity
Journal title :
SIAM Journal on Computing
Serial Year :
1999
Journal title :
SIAM Journal on Computing
Record number :
16614
Link To Document :
بازگشت