1133 search results - page 79 / 227 » Basics of Graph Cuts |
147
click to vote
GD
2004
Springer
16 years 14 hour ago
2004
Springer
The efforts put into XML-related technologies have exciting consequences for XML-based graph data formats such as GraphML. We here give a systematic overview of the possibilities ...
174
click to vote
COMBINATORICA
2004
15 years 6 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
206
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
202
click to vote
OL
2011
14 years 9 months ago
2011
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
147
click to vote
CVPR
2010
IEEE
16 years 2 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...