5606 search results - page 19 / 1122 » Randomization Techniques for Graphs. |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
COMBINATORICS
2006
13 years 8 months ago
2006
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
RSA
2010
13 years 6 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...