558 search results - page 7 / 112 » Trees and Matchings |
ICPP
1987
IEEE
15 years 1 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
110
click to vote
TASLP
2008
14 years 9 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...
102
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...