1110 search results - page 7 / 222 » Clustering with the Connectivity 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...
PDCAT
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. This paper proposes a kernel to kernel communication system for use in cluster computers. It is implemented directly on the Ethernet data link layer. This allows use of E...
ESCAPE
2007
Springer
13 years 11 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
IJCV
2007
13 years 7 months ago
2007
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...