Results 201 to 210 of about 1,405 (240)
A Kernelization Algorithm for d-Hitting Set
For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s).
Faisal N Abu-Khzam
exaly +3 more sources
Kernelization: New Upper and Lower Bound Techniques
. In this survey, we look at kernelization: algorithms that transform in polynomial time an input to a problem to an equivalent input, whose size is bounded by a function of a parameter.
Hans L. Bodlaender
exaly +1 more source
Meta-Kernelization Using Well-Structured Modulators
Kernelization investigates exact preprocessing algorithms with performance guarantees. The most prevalent type of parameters used in kernelization is the solution size for optimization problems; however, also structural parameters have been successfully ...
Stefan Szeider +2 more
exaly +2 more sources
Kernel Factory: An ensemble of kernel machines [PDF]
We propose an ensemble method for kernel machines. The training data is randomly split into a number of mutually exclusive partitions defined by a row and column parameter. Each partition forms an input space and is transformed by an automatically selected kernel function into a kernel matrix K.
Michel Ballings, Dirk Van den Poel
openaire +2 more sources
Propagation via Kernelization: The Vertex Cover Constraint
International audienceThe technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter k.
Emmanuel Hebrard, Clément Carbonnel
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2011 International Conference on Computer Vision, 2011
Naive Bayes Nearest Neighbor (NBNN) has recently been proposed as a powerful, non-parametric approach for object classification, that manages to achieve remarkably good results thanks to the avoidance of a vector quantization step and the use of image-to-class comparisons, yielding good generalization.
Tinne Tuytelaars +3 more
openaire +3 more sources
Naive Bayes Nearest Neighbor (NBNN) has recently been proposed as a powerful, non-parametric approach for object classification, that manages to achieve remarkably good results thanks to the avoidance of a vector quantization step and the use of image-to-class comparisons, yielding good generalization.
Tinne Tuytelaars +3 more
openaire +3 more sources
Partitionable Kernels for Mapping Kernels
2011 IEEE 11th International Conference on Data Mining, 2011Many of tree kernels in the literature are designed tanking advantage of the mapping kernel framework. The most important advantage of using this framework is that we have a strong theorem to examine positive definiteness of the resulting tree kernels.
openaire +2 more sources
Multiple kernel clustering with corrupted kernels
Neurocomputing, 2017Abstract Multiple kernel clustering (MKC) algorithms usually learn an optimal kernel from a group of pre-specified base kernels to improve the clustering performance. However, we observe that existing MKC algorithms do not well handle the situation that kernels are corrupted with noise and outliers.
Teng Li 0010 +4 more
openaire +1 more source
Communications of the ACM, 2018
Choosing between programming in the kernel or in user space.
openaire +2 more sources
Choosing between programming in the kernel or in user space.
openaire +2 more sources
Reliable Computing, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources

