108 search results - page 2 / 22 » Greedy Algorithm for a Training Set Reduction in the Kernel ... |
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
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...
FCCM
2005
IEEE
14 years 1 months ago
2005
IEEE
FPGA-based floating-point kernels must exploit algorithmic parallelism and use deeply pipelined cores to gain a performance advantage over general-purpose processors. Inability t...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. ...
GBRPR
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...