Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
In the context of mobile and pervasive networking, it is not uncommon to experience frequent loss of connectivity. Congestion control algorithms usually mistake resulting packets ...
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
Non-negative matrix factorization (NMF) is a powerful feature extraction method for finding parts-based, linear representations of non-negative data . Inherently, it is unsupervis...
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
Andreas Argyriou, Charles A. Micchelli, Massimilia...