Space and time optimal algorithms for a class of rectangle intersection problems.
Vijay K. VaishnaviHans-Peter KriegelDerick WoodPublished in: Inf. Sci. (1980)
Keyphrases
- optimization problems
- convex optimization problems
- worst case
- approximate solutions
- computational cost
- linear space
- benchmark problems
- difficult problems
- significant improvement
- computational complexity
- dynamic programming
- practical problems
- theoretical analysis
- data structure
- combinatorial optimization
- test problems
- problems in computer vision
- partial solutions
- computationally hard
- binary classification problems
- computational geometry
- related problems
- exhaustive search
- run times
- globally optimal solutions
- squared euclidean distance
- learning algorithm
- reproducing kernel hilbert space
- machine learning algorithms
- np complete
- low dimensional
- search space
- objective function