We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, f...
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
This paper studies a method for the identification of Hammerstein models based on Least Squares Support Vector Machines (LS-SVMs). The technique allows for the determination of th...
Ivan Goethals, Kristiaan Pelckmans, Johan A. K. Su...
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...