Sciweavers

625 search results - page 35 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
ICC
2007
IEEE
303views Communications» more  ICC 2007»
15 years 6 months ago
Diversity and Multiplexing in Cooperative Wireless Cellular Networks
Abstract— In wireless cellular systems, capacity can be increased if both in-cell and out-of-cell cochannel interference (CCI) is properly handled. Moreover, spatial multiplexing...
Diego Piazza, Guido Tartara
DCOSS
2006
Springer
15 years 3 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
15 years 5 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ESANN
2003
15 years 1 months ago
Approximation of Function by Adaptively Growing Radial Basis Function Neural Networks
In this paper a neural network for approximating function is described. The activation functions of the hidden nodes are the Radial Basis Functions (RBF) whose parameters are learn...
Jianyu Li, Siwei Luo, Yingjian Qi
TELETRAFFIC
2007
Springer
15 years 5 months ago
Performance Analysis of a Fluid Queue with Random Service Rate in Discrete Time
We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...
Onno J. Boxma, Vinod Sharma, D. K. Prasad