Sciweavers

862 search results - page 72 / 173
» Random Information Spread in Networks
Sort
View
PCI
2005
Springer
15 years 5 months ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 6 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
MM
2004
ACM
155views Multimedia» more  MM 2004»
15 years 5 months ago
Disruption-tolerant content-aware video streaming
Communication between a pair of nodes in the network may get disrupted due to failures of links/nodes resulting in zero effective bandwidth between them during the recovery perio...
Tiecheng Liu, Srihari Nelakuditi
BMCBI
2004
114views more  BMCBI 2004»
14 years 11 months ago
Extending the mutual information measure to rank inferred literature relationships
Background: Within the peer-reviewed literature, associations between two things are not always recognized until commonalities between them become apparent. These commonalities ca...
Jonathan D. Wren
TSP
2010
14 years 6 months ago
Distributed estimation of channel gains in wireless sensor networks
We consider the problem of distributed channel estimation in a sensor network which employs a random sleep strategy to conserve energy. If the N network nodes are randomly placed a...
Sivagnanasundaram Ramanan, John MacLaren Walsh