Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
Jeffrey Ho, Adrian Peter, Anand Rangarajan, Ming-H...
This work shows a modular architecture based on FPGA's to solve the eigenvalue problem according to the Jacobi method. This method is able to solve the eigenvalues and eigenv...
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...