1964 search results - page 56 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
145
click to vote
PARA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
167
Voted
IAJIT
2008
15 years 1 months ago
2008
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
122
Voted
SIAMCOMP
1998
15 years 1 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
103
Voted
ICPR
2000
IEEE
15 years 6 months ago
2000
IEEE
Thispaper presents a text word extraction algorithm that takes a set of bounding boxes of glyphs and their associated text lines of a given document andpartitions the glyphs into ...
132
Voted
PAMI
2010
15 years 8 days ago
2010
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...