238 search results - page 43 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
100
click to vote
ICPADS
2005
IEEE
15 years 3 months ago
2005
IEEE
This work presents a new comparison-based diagnosis model and a new algorithm, called Hi-Dif, based on this model. The algorithm is used for checking the integrity of systems with...
CPM
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
TPDS
2008
14 years 9 months ago
2008
Hierarchical scheduling has been proposed as a scheduling technique to achieve aggregate resource partitioning among related groups of threads and applications in uniprocessor and...
ICDCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Spatial alarms are considered as one of the basic capabilities in future mobile computing systems for enabling personalization of location-based services. In this paper, we propos...
STOC
1996
ACM
15 years 1 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...