13 search results - page 1 / 3 » A Polynomial Kernel for Multicut in Trees |
STACS
2009
Springer
13 years 11 months ago
2009
Springer
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
TASLP
2008
13 years 4 months ago
2008
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
IWPEC
2010
Springer
13 years 2 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
COLING
2010
12 years 12 months ago
2010
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...