Sciweavers

101
Voted
DCC
2002
IEEE
16 years 11 days ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr