Depth lower bounds in Stabbing Planes for combinatorial principles.
Stefan S. DantchevNicola GalesiAbdul GhaniBarnaby MartinPublished in: Log. Methods Comput. Sci. (2024)
Keyphrases
- lower bound
- upper bound
- branch and bound
- depth information
- depth map
- objective function
- optimal cost
- upper and lower bounds
- vc dimension
- worst case
- optimal solution
- planar surfaces
- lower bounding
- theoretical framework
- three dimensional
- image registration
- np hard
- branch and bound algorithm
- design principles
- depth images
- high quality
- lower and upper bounds
- linear programming relaxation
- neural network