Trees with exponentially growing costs

13 years 4 months 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

» Bonsai Growing Interesting Small Trees

» TwoStage Robust Network Design with Exponential Scenarios

» A New Approach for Tree Alignment Based on Local ReOptimization

» Mining Recurring Events Through Forest Growing

» Optimizing deletion cost for secure multicast key management

» Exploiting the Cost Insensitivity of Decision Tree Splitting Criteria

» Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization

» A Hybrid Method to Detect Deflation Fraud in CostPerAction Online Advertising

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