Query-competitive algorithms for cheapest set problems under uncertainty.
Thomas ErlebachMichael HoffmannFrank KammerPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- optimization problems
- learning algorithm
- formally define
- data structure
- partial solutions
- polynomial time complexity
- optimization criteria
- user defined
- rank join
- problems in computer vision
- benchmark problems
- combinatorial optimization
- related problems
- linear space
- query processing
- search methods
- np complete
- test problems
- database
- query expansion
- multi dimensional
- access methods
- relevance feedback
- probability distribution
- computational geometry
- exact and approximate
- pre computed
- computational complexity