1664 search results - page 128 / 333 » Distance labeling in graphs |
137
click to vote
EJC
2008
15 years 4 months ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
144
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
167
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
164
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
144
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...