1949 search results - page 149 / 390 » Random graphs on surfaces |
194
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
Solid texturing is a powerful way to add detail to the surface of rendered objects. Perlin's "noise" is a 3D basis function used in some of the most dramatic and us...
173
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
204
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
221
click to vote
CPC
2011
15 years 1 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
186
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...