296 search results - page 17 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
117
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
108
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
218
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
131
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...