Abstract: We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results