Sciweavers

13214 search results - page 214 / 2643
» Pseudorandomness for network algorithms
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
WIMOB
2008
IEEE
16 years 29 days ago
PGMS: Pseudo-optimal Greedy Media Streaming Algorithm for Heterogeneous Wireless Networks
The integration of different wireless access technologies combined with the huge characteristic diversity of supported services in next-generation systems creates a real heterogen...
Ahmed H. Zahran, Cormac J. Sreenan
ISCC
2006
IEEE
16 years 18 days ago
Analysis of Resource Increase and Decrease Algorithm in Wireless Sensor Networks
In this paper, we first attempt to formally define the resource control framework that adjusts the resource provisioning at the hotspot during congestion. In an effort to find ...
JaeWon Kang, Yanyong Zhang, Badri Nath
JCP
2008
145views more  JCP 2008»
15 years 6 months ago
An Effective Mining Algorithm for Weighted Association Rules in Communication Networks
The mining of weighted association rules is one of the primary methods used in communication alarm correlation analysis. With large communication alarm database, the traditional me...
Jian Wu, Xing ming Li
PIMRC
2010
IEEE
15 years 4 months ago
Fair and efficient resource allocation algorithm for uplink multicarrier based cognitive networks
This paper presents an efficient and fair uplink resource allocation algorithm in multicarrier based cognitive radio systems. The proposed resource allocation is divided into two s...
Musbah Shaat, Faouzi Bader