5889 search results - page 471 / 1178 » Graph Layout Problems |
172
click to vote
JGT
2007
15 years 7 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
226
click to vote
ICIAR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
225
click to vote
PAMI
2010
15 years 6 months ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
239
click to vote
CIARP
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
188
click to vote
GD
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...