823 search results - page 119 / 165 » Brick partitions of graphs |
143
click to vote
DM
2000
15 years 1 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
118
click to vote
JSSPP
2010
Springer
14 years 12 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
179
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...
121
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
121
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...