829 search results - page 74 / 166 » Distance domination-critical graphs |
120
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
165
click to vote
ALGORITHMICA
2011
14 years 7 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
211
click to vote
IPMI
2011
Springer
14 years 3 months ago
2011
Springer
Tumor segmentation in PET and CT images is notoriously challenging due to the low spatial resolution in PET and low contrast in CT images. In this paper, we proposed a general fram...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...