A note on the MIR closure and basic relaxations of polyhedra.
Sanjeeb DashOktay GünlükChristian RaackPublished in: Oper. Res. Lett. (2011)
Keyphrases
- lower bound
- multimedia information retrieval
- linear programming
- line drawings
- multimedia retrieval
- semidefinite
- data sets
- np hard
- convex polyhedra
- special case
- expert systems
- pairwise
- database
- upper bound
- similarity measure
- convex sets
- linear systems
- computer vision
- genetic algorithm
- neural network
- strictly convex
- real time