1149 search results - page 62 / 230 » Minimally non-Pfaffian graphs |
118
click to vote
CVPR
2008
IEEE
16 years 1 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...
101
click to vote
MICCAI
2008
Springer
16 years 1 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 ...
105
click to vote
DIAGRAMS
2004
Springer
15 years 5 months ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
ACSC
2003
IEEE
15 years 5 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
111
click to vote
DAM
2000
14 years 11 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...