96 search results - page 1 / 20 » An exact algorithm for maximum independent set in degree-5 g... |
112
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
74
Voted
WADS
2001
Springer
15 years 4 months ago
2001
Springer
281
Voted
CVPR
2011
IEEE
14 years 7 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 ...
153
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...