Given a connected, undirected graph G whose edges are labeled (or colored), the minimum labeling spanning tree (MLST) problem seeks a spanning tree on G with the minimum number of distinct labels (or ...

Support Vector Machine (SVM) is one of the most widely used algorithms for solving classification and regression problems. SVM parameters such as the kernel and the penalty (C) parameters greatly ...