Sciweavers

1542 search results - page 93 / 309
» Kernelization of packing problems
Sort
View
IJON
2006
119views more  IJON 2006»
15 years 1 months ago
Support vector machine for functional data classification
Abstract. Functional data analysis is a growing research field and numerous works present a generalization of the classical statistical methods to function classification or regres...
Fabrice Rossi, Nathalie Villa
IWPEC
2009
Springer
15 years 8 months ago
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
Gregory Gutin, Eun Jung Kim, Stefan Szeider, Ander...
CATS
2008
15 years 3 months ago
Parameterized Complexity of the Clique Partition Problem
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
Egbert Mujuni, Frances A. Rosamond
ADCM
2008
71views more  ADCM 2008»
15 years 1 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
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 2 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue