Sciweavers

866 search results - page 8 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 11 months ago
Theory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...
INFOCOM
2010
IEEE
14 years 10 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
JSAC
2008
177views more  JSAC 2008»
14 years 11 months ago
Adaptive Routing Strategies in IEEE 802.16 Multi-Hop Wireless Backhaul Networks Based On Evolutionary Game Theory
The high frequency segment (10-66GHz) of the IEEE 802.16 standard seems promising for the implementation of wireless backhaul networks carrying large volumes of Internet traffic. I...
Markos P. Anastasopoulos, Pantelis-Daniel M. Arapo...
MDM
2009
Springer
126views Communications» more  MDM 2009»
15 years 6 months ago
Outlier Detection in Ad Hoc Networks Using Dempster-Shafer Theory
Mobile Ad-hoc NETworks (MANETs) are known to be vulnerable to a variety of attacks due to lack of central authority or fixed network infrastructure. Many security schemes have bee...
Wenjia Li, Anupam Joshi
ICASSP
2008
IEEE
15 years 6 months ago
Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
Yuzhe Jin, Bhaskar D. Rao