Upper bounds on the queuenumber of k-ary n-cubes.
Kung-Jui PaiJou-Ming ChangYue-Li WangPublished in: Inf. Process. Lett. (2009)
Keyphrases
- upper bound
- lower bound
- worst case
- tight bounds
- branch and bound
- upper and lower bounds
- data cube
- database
- upper bounding
- concept classes
- lower and upper bounds
- tight upper and lower bounds
- efficiently computable
- generalization error
- sample size
- vc dimension
- sample complexity
- multi dimensional
- optimal solution
- case study
- learning algorithm