12 search results - page 2 / 3 » A randomized, o(log w)-depth 2 smoothing network |
ESA
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
ICDCS
2008
IEEE
13 years 11 months ago
2008
IEEE
In most large-scale peer-to-peer (P2P) applications, it is necessary to collect vital statistics data — sometimes referred to as logs — from up to millions of peers. Tradition...
IMC
2006
ACM
13 years 11 months ago
2006
ACM
In this paper we present the first implementation of a P2P content distribution system that uses Network Coding. Using results from live trials with several hundred nodes, we pro...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
TIP
2008
13 years 5 months ago
2008
Abstract--In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constrain...