DS++: A flexible, scalable and provably tight relaxation for matching problems.
Nadav DymHaggai MaronYaron LipmanPublished in: CoRR (2017)
Keyphrases
- database
- lightweight
- np complete
- real time
- iterative algorithms
- problems involving
- optimization problems
- decision trees
- feature selection
- web services
- bayesian networks
- information systems
- machine learning
- pattern matching
- combinatorial optimization
- graph matching
- matching process
- neural network
- convex relaxation
- data sets
- scale poorly