Upper bounds on exponentiated expected length of optimal one-to-one codes.

Jay Cheng Tien-Ke Huang

Published in: IWCMC (2006)

Keyphrases

upper bound
worst case
efficiently computable
lower bound
upper and lower bounds
optimal cost
tight bounds
constant factor
optimal solution
dynamic programming
risk neutral
neural network
branch and bound
provide an upper bound
fixed length
optimal design
lower and upper bounds
sample complexity
closed form