455 search results - page 15 / 91 » A local approximation algorithm for maximum weight matching |
101
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
296
click to vote
CVPR
2011
IEEE
14 years 8 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 ...
133
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
117
click to vote
UAI
2001
15 years 2 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...