1326 search results - page 27 / 266 » Approximate Tree Kernels |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
IJKESDP
2010
13 years 7 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
ISCC
2005
IEEE
14 years 2 months ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper we introduce a family of filter kernels the Gray-Code Kernels (GCK) and demonstrate their use in image analysis. Filtering an image with a sequence of Gray-Code Kern...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...