Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
Emanuele Frandi, Maria Grazia Gasparo, Stefano Lod...
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
This paper first provides a common framework for partial differential equation problems in both strong and weak form by rewriting them as generalized interpolation problems. Then ...
The goal of this paper is the development of a novel approach for the problem of Noise Removal, based on the theory of Reproducing Kernels Hilbert Spaces (RKHS). The problem is ca...