8 search results - page 2 / 2 » Randomly colouring graphs (a combinatorial view) |
IVC
2007
14 years 11 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
100
click to vote
PAMI
2007
14 years 11 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...