106 search results - page 3 / 22 » SDP-Based Algorithms for Maximum Independent Set Problems on... |
126
Voted
IPCO
2010
15 years 4 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
122
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
308
Voted
CVPR
2011
IEEE
14 years 10 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 ...
123
Voted
WEA
2005
Springer
15 years 8 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
111
Voted
COLT
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...