1154 search results - page 162 / 231 » On the editing distance of graphs |
JCO
2010
13 years 7 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
COMBINATORICA
2011
12 years 8 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
CVPR
2010
IEEE
14 years 5 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...
ALGORITHMICA
2011
13 years 3 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...
IPMI
2011
Springer
13 years 9 days 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...