The Computational Complexity of Weighted Greedy Matching.
Argyrios DeligkasGeorge B. MertziosPaul G. SpirakisPublished in: AAAI (2017)
Keyphrases
- computational complexity
- np complete
- matching algorithm
- search algorithm
- association graph
- special case
- greedy algorithm
- genetic algorithm
- weighted sum
- feature matching
- memory requirements
- pattern matching
- matching scheme
- graph matching
- motion estimation
- computational cost
- rate distortion
- data sets
- computational efficiency
- feature points
- np hard
- object recognition
- computer vision
- high computational complexity
- ontology matching
- locally optimal
- machine learning