5606 search results - page 177 / 1122 » Randomization Techniques for Graphs. |
118
click to vote
CVPR
2008
IEEE
16 years 2 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...
RSA
2010
14 years 11 months ago
2010
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
104
click to vote
ECCV
2010
Springer
15 years 6 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...
103
click to vote
IV
2006
IEEE
15 years 6 months ago
2006
IEEE
We present interactive visual aids to support the exploration and navigation of graph layouts. They include Fisheye Tree Views and Composite Lenses. These views provide, in an int...
113
Voted
STOC
2004
ACM
15 years 6 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...