Sciweavers

238 search results - page 11 / 48
» Parallel Algorithm for Maximum Weight Matching in Trees
Sort
View
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
15 years 3 months ago
Ant System for the k-Cardinality Tree Problem
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...
Thang Nguyen Bui, Gnanasekaran Sundarraj
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
14 years 11 months ago
Optimal Random Matchings on Trees and Applications
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...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
IPL
2007
114views more  IPL 2007»
14 years 9 months ago
Spanning trees with minimum weighted degrees
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),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
AINA
2008
IEEE
15 years 4 months ago
Exploiting Frequent Episodes in Weighted Suffix Tree to Improve Intrusion Detection System
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,...
Min-Feng Wang, Yen-Ching Wu, Meng-Feng Tsai
GBRPR
2009
Springer
15 years 1 months ago
Homeomorphic Alignment of Edge-Weighted Trees
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...
Benjamin Raynal, Michel Couprie, Venceslas Biri