238 search results - page 10 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
114
click to vote
SRDS
1998
IEEE
15 years 6 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
300
Voted
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
105
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
141
click to vote
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
147
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...