238 search results - page 11 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
99
Voted
APPROX
2008
Springer
15 years 3 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...
128
click to vote
IPL
2007
15 years 1 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
107
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
128
click to vote
GBRPR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...