1664 search results - page 163 / 333 » Distance labeling in graphs |
120
click to vote
AAIM
2008
Springer
15 years 11 months ago
2008
Springer
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
149
click to vote
ACCV
2007
Springer
15 years 11 months ago
2007
Springer
We present a novel approach to image segmentation using iterated Graph Cuts based on multi-scale smoothing. We compute the prior probability obtained by the likelihood from a color...
137
Voted
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
211
click to vote
ACCV
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
163
click to vote
CCCG
2010
15 years 6 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...