Algorithms for high dimensional stabbing problems.
David AvisMike DoskasPublished in: Discret. Appl. Math. (1990)
Keyphrases
- high dimensional
- combinatorial optimization
- problems in computer vision
- optimization problems
- run times
- high dimensional problems
- related problems
- benchmark problems
- orders of magnitude
- learning algorithm
- computational cost
- practical problems
- computational problems
- data mining tasks
- estimation problems
- difficult problems
- graph theory
- significant improvement
- approximate solutions
- specific problems
- worst case
- benchmark datasets
- np hard problems
- theoretical analysis
- machine learning
- search space
- computational geometry
- discrete data
- bayesian networks
- convex optimization problems
- exact algorithms
- search algorithm
- dimensionality reduction
- search methods
- high dimensionality
- times faster
- similarity search
- low dimensional
- linear programming