The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
In previous work, we proposed ValueCharts, a set of visualizations and interactive techniques to support the inspection of linear models of preferences. We now identify the need t...
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
Physics-based modeling integrates dynamics and geometry. The standard methods to solve the Lagrangian equations use a direct approach in the spatial domain. Though extremely power...