Login / Signup

DS++: a flexible, scalable and provably tight relaxation for matching problems.

Nadav DymHaggai MaronYaron Lipman
Published in: ACM Trans. Graph. (2017)
Keyphrases
  • lightweight
  • matching algorithm
  • optimization problems
  • lower bound
  • evolutionary algorithm
  • iterative algorithms
  • computer vision
  • multiscale
  • np complete
  • matching process
  • problems involving
  • web scale