On Lower Bounds for the Capacity of Deletion Channels.
Eleni DrineaMichael MitzenmacherPublished in: IEEE Trans. Inf. Theory (2006)
Keyphrases
- online learning
- lower bound
- upper bound
- np hard
- worst case
- branch and bound
- objective function
- lower bounding
- branch and bound algorithm
- lower and upper bounds
- upper and lower bounds
- randomly generated problems
- multi channel
- vc dimension
- neural network
- optimal cost
- special case
- theoretical analysis
- scheduling problem
- linear programming relaxation
- optimal solution
- data sets