1949 search results - page 158 / 390 » Random graphs on surfaces |
134
Voted
COMBINATORICA
2007
15 years 4 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
168
Voted
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...
117
Voted
RSA
2010
15 years 3 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...
136
click to vote
GRAPHICSINTERFACE
2000
15 years 6 months ago
2000
In this paper, we present an efficient way to denoise bivariate data like height fields, color pictures or vector fields, while preserving edges and other features. Mixing surface...
145
Voted
ECCV
2010
Springer
15 years 10 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...