2310 search results - page 127 / 462 » Coloring Random Graphs |
133
click to vote
CVPR
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper develops an analytic model for self shadowing and local illumination of rough surfaces. The surface is assumed homogeneous, isotropic, and smooth microscopically, with ...
145
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—This paper builds a generic modeling framework for analyzing the edge-creation process in dynamic random graphs in which nodes continuously alternate between active and inactive...
124
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
127
click to vote
ACSC
2005
IEEE
15 years 8 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
120
click to vote
SIAMDM
2010
14 years 9 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...