253 search results - page 7 / 51 » Random Walks with Look-Ahead in Scale-Free Random Graphs |
ICASSP
2011
IEEE
13 years 8 days ago
2011
IEEE
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
ISTCS
1993
Springer
14 years 19 days ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
CVPR
2009
IEEE
14 years 3 months ago
2009
IEEE
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
AAAI
2008
13 years 11 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...