1951 search results - page 215 / 391 » An algorithm for improving graph partitions |
163
click to vote
PLDI
1993
ACM
15 years 9 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
149
click to vote
IJPP
2011
15 years 13 days ago
2011
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
144
Voted
DAM
2008
15 years 5 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
155
click to vote
COCO
2009
Springer
16 years 3 days ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
163
Voted
MM
2009
ACM
15 years 10 months ago
2009
ACM
In this work the problem of automatic decomposition of video into elementary semantic units, known in the literature as scenes, is addressed. Two multi-modal automatic scene segme...