Sciweavers

2796 search results - page 535 / 560
» The coolest path problem
Sort
View
NETWORK
2010
122views more  NETWORK 2010»
14 years 6 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
TDSC
2010
157views more  TDSC 2010»
14 years 6 months ago
On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
Fei Xing, Wenye Wang
TON
2010
198views more  TON 2010»
14 years 6 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
V. J. Venkataramanan, Xiaojun Lin
ICASSP
2011
IEEE
14 years 3 months ago
Robust nonparametric regression by controlling sparsity
Nonparametric methods are widely applicable to statistical learning problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeat...
Gonzalo Mateos, Georgios B. Giannakis
ICASSP
2011
IEEE
14 years 3 months ago
Time prediction of non flat fading channels
In this paper three different techniques to predict the channel transfer functions of non flat fading channels in multiple antenna systems are investigated. The prediction is don...
Nico Palleit, Tobias Weber