2314 search results - page 243 / 463 » Minimal Partitions of a Graph |
136
click to vote
JCO
2010
15 years 2 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
162
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
185
click to vote
APVIS
2011
14 years 4 months ago
2011
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...
176
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
141
click to vote
MICCAI
2008
Springer
16 years 5 months ago
2008
Springer
Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching ...