Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
— Many problems in the engineering domain involve more than one objective to be optimized simultaneously. The optimal solution to a multi-objective function results in a set of e...
A large number of methods for circle detection has been studied in the last years for numerous image processing applications. The application domain considered in this paper is th...
Due to its wide applicability, the problem of semi-supervised classification is attracting increasing attention in machine learning. Semi-Supervised Support Vector Machines (S3VMs...
Olivier Chapelle, Vikas Sindhwani, S. Sathiya Keer...
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...