2314 search results - page 371 / 463 » Minimal Partitions of a Graph |
128
click to vote
CAI
2002
Springer
15 years 3 months ago
2002
Springer
In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth ...
120
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
140
click to vote
IJCM
2002
15 years 3 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
163
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Global shape information is an effective top-down complement
to bottom-up figure-ground segmentation as well
as a useful constraint to avoid drift during adaptive tracking.
We p...
148
Voted
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper deals with segmentation of the lung tissues from low dose CT (LDCT) scans of the chest. Goal is correct segmentation as well as maintaining the details of the lung regi...