Abstract: Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic relaxation methods are widely used for solving BQPs, namely, spectral methods and semi ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback