Sciweavers

1949 search results - page 6 / 390
» Random graphs on surfaces
Sort
View
AML
2004
94views more  AML 2004»
13 years 7 months ago
The cofinality of the saturated uncountable random graph
Assuming CH, let 1 be the saturated random graph of cardinal
Steve Warner
RSA
2006
98views more  RSA 2006»
13 years 7 months ago
Levels of a scale-free tree
Consider the random graph model of Barab
Zsolt Katona
ICCV
2007
IEEE
14 years 9 months ago
Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
Sudipta N. Sinha, Philippos Mordohai, Marc Pollefe...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 9 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
SODA
2001
ACM
138views Algorithms» more  SODA 2001»
13 years 8 months ago
The diameter of random massive graphs
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
Linyuan Lu