1605 search results - page 230 / 321 » On Partitional Labelings of Graphs |
JSSPP
2010
Springer
13 years 8 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 ...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
We address the character identification problem in
movies and television videos: assigning names to faces on
the screen. Most prior work on person recognition in video
assumes s...
CVPR
2007
IEEE
15 years 1 days ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
CVPR
2009
IEEE
15 years 5 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
...