1414 search results - page 6 / 283 » Cover Time and Broadcast Time |
194
click to vote
RSA
2011
15 years 1 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
181
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
168
click to vote
IGARSS
2009
15 years 4 months ago
2009
This paper shows that a feedforward Multilayer Perceptron (MLP) operating over a temporal sliding window of multispectral time series MODerate-resolution Imaging Spectroradiometer...
212
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
145
click to vote
JCT
2007
15 years 6 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...