Computational Aspects of Ordered Integer Partition with Upper Bounds.
Roland GlückDominik KöpplGünther WirschingPublished in: SEA (2013)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- branch and bound algorithm
- tight bounds
- worst case
- sample size
- lower and upper bounds
- upper bounding
- partially ordered
- branch and bound
- efficiently computable
- sample complexity
- tight upper and lower bounds
- integer valued
- partitioning algorithm
- vc dimension
- generalization error
- neural network
- sufficient conditions
- reinforcement learning
- image segmentation