Sciweavers

930 search results - page 66 / 186
» Adding Gaussian noise to
Sort
View
DAGSTUHL
2007
15 years 7 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
ICC
2009
IEEE
124views Communications» more  ICC 2009»
16 years 19 days ago
Distributed Interference Pricing for the MIMO Interference Channel
Abstract—We study distributed algorithms for updating transmit precoding matrices for a two-user Multi-Input/Multi-Output (MIMO) interference channel. Our objective is to maximiz...
Changxin Shi, David A. Schmidt, Randall A. Berry, ...
JCP
2007
108views more  JCP 2007»
15 years 5 months ago
A Genetic Algorithm Method to Assimilate Sensor Data for a Toxic Contaminant Release
— Following a toxic contaminant release, either accidental or intentional, predicting the transport and dispersion of the contaminant becomes a critical problem for Homeland Defe...
Sue Ellen Haupt, George S. Young, Christopher T. A...
TSP
2010
15 years 18 days ago
Statistics of Co-Channel Interference in a Field of Poisson and Poisson-Poisson Clustered Interferers
Abstract--With increasing spatial reuse of radio spectrum, cochannel interference is becoming a dominant noise source and may severely degrade the communication performance of wire...
Kapil Gulati, Brian L. Evans, Jeffrey G. Andrews, ...
TSP
2010
15 years 18 days ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...