Sciweavers

4670 search results - page 361 / 934
» Testing that distributions are close
Sort
View
TIT
2010
158views Education» more  TIT 2010»
15 years 1 months ago
Belief propagation, Dykstra's algorithm, and iterated information projections
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
John MacLaren Walsh, Phillip A. Regalia
WD
2010
15 years 1 months ago
Uplink capacity analysis of OFDMA based cellular networks with reuse-1
Abstract--OFDMA based cellular radio networks aim to operate as close as possible to frequency reuse distance of one, where the whole spectrum would be available in every cell. Mod...
Maciej Mühleisen, Daniel Bültmann, Bernh...
ICASSP
2011
IEEE
14 years 10 months ago
Stochastic transceiver design in multi-antenna channels with statistical channel state information
The problem of stochastic robust sum mean square error (MSE) minimization transceiver design is addressed for multiple-input multiple-output (MIMO) broadcast channels (BCs). The t...
Andreas Gründinger, Michael Joham, Wolfgang U...
ICASSP
2011
IEEE
14 years 10 months ago
Transmit beamspace design for direction finding in colocated MIMO radar with arbitrary receive array
The transmit beamspace design problem for colocated multiple-input multiple-output (MIMO) radar is considered. We show that the MIMO radar transmit beampattern can be designed so ...
Arash Khabbazibasmenj, Aboulnasr Hassanien, Sergiy...
IPSN
2010
Springer
16 years 1 months ago
KleeNet: discovering insidious interaction bugs in wireless sensor networks before deployment
Complex interactions and the distributed nature of wireless sensor networks make automated testing and debugging before deployment a necessity. A main challenge is to detect bugs ...
Raimondas Sasnauskas, Olaf Landsiedel, Muhammad Ha...