1326 search results - page 10 / 266 » Approximate Tree Kernels |
JCO
2006
13 years 8 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
ALGORITHMICA
2005
13 years 8 months ago
2005
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
SKG
2006
IEEE
14 years 2 months ago
2006
IEEE
Convolution kernels, such as tree kernel and subsequence kernel are useful for natural language processing tasks. However, most of them ignore the semantic knowledge. In order to ...
JMLR
2006
13 years 8 months ago
2006
In this paper we investigate conditions on the features of a continuous kernel so that it may approximate an arbitrary continuous target function uniformly on any compact subset o...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Almost all tree kernels proposed in the literature match substructures without taking into account their relative positioning with respect to one another. In this paper, we propos...