Sciweavers

661 search results - page 56 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
ICALP
2009
Springer
15 years 4 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
IMC
2010
ACM
14 years 7 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
EUROPAR
2009
Springer
15 years 4 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
WIOPT
2010
IEEE
14 years 7 months ago
A stochastic geometry model for the best signal quality in a wireless network
Abstract--In a wireless network composed of randomly scattered nodes, the characterization of the distribution of the best signal quality received from a group of nodes is of prima...
Van Minh Nguyen, François Baccelli
IJON
2007
184views more  IJON 2007»
14 years 9 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen