Trees with exponentially growing costs

14 years 15 days ago

Download www.cs.ust.hk

We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in connection with R

Frank Schulz

Real-time Traffic

Code Trees | Generalized Huffman Algorithm | IANDC 2008 | Search Tree |

claim paper

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	IANDC
Authors	Frank Schulz

Comments (0)

Sciweavers

Trees with exponentially growing costs

Code Trees | Generalized Huffman Algorithm | IANDC 2008 | Search Tree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers