Sciweavers

613 search results - page 13 / 123
» The Pre-Image Problem in Kernel Methods
Sort
View
MST
2007
154views more  MST 2007»
13 years 7 months ago
Crown Structures for Vertex Cover Kernelization
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...
CIARP
2010
Springer
13 years 4 months ago
A New Algorithm for Training SVMs Using Approximate Minimal Enclosing Balls
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...
FSTTCS
2000
Springer
13 years 11 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
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....
ADCM
2008
71views more  ADCM 2008»
13 years 7 months ago
Solvability of partial differential equations by meshless kernel methods
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 ...
Y. C. Hon, Robert Schaback
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 2 months ago
Edge Preserving Image Denoising in Reproducing Kernel Hilbert Spaces
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...
Pantelis Bouboulis, Sergios Theodoridis