Sciweavers

5580 search results - page 118 / 1116
» Randomized priority algorithms
Sort
View
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
15 years 7 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
DEXA
2008
Springer
130views Database» more  DEXA 2008»
15 years 4 months ago
Classifying Evolving Data Streams Using Dynamic Streaming Random Forests
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
IPSN
2003
Springer
15 years 7 months ago
Distributed Environmental Monitoring Using Random Sensor Networks
Abstract. We present a distributed algorithm for environmental monitoring of a scalar field (such as temperature, intensity of light, atmospheric pressure, etc.) using a random se...
Slobodan N. Simic, Shankar Sastry
SPDP
1990
IEEE
15 years 6 months ago
Randomized fault-detecting leader election in a bi-directional ring
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...
N. R. Wagner
89
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...