1949 search results - page 61 / 390 » Random graphs on surfaces |
184
click to vote
ICASSP
2011
IEEE
14 years 7 months 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 ...
130
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
125
click to vote
RSA
2011
14 years 10 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
117
click to vote
JCT
2011
14 years 10 months ago
2011
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
133
click to vote
IM
2008
15 years 3 months ago
2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...