Depth lower bounds in Stabbing Planes for combinatorial principles.
Stefan S. DantchevNicola GalesiAbdul GhaniBarnaby MartinPublished in: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- lower and upper bounds
- depth map
- branch and bound
- np hard
- depth information
- lower bounding
- three dimensional
- piecewise planar
- upper and lower bounds
- vc dimension
- worst case
- d objects
- sample complexity
- depth images
- optimal solution
- planar surfaces
- linear programming relaxation
- computer vision
- neural network