Sciweavers

4616 search results - page 107 / 924
» The Communication Complexity of Correlation
Sort
View
PIMRC
2008
IEEE
16 years 23 days ago
The design and detection of signature sequences in time-frequency selective channel
Abstract— In a slot-synchronized wireless communication system, a set of signature sequences can be derived by circularly shifting a base sequence with good auto correlation prop...
Jiann-Ching Guey
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 10 months ago
Derandomized Parallel Repetition Theorems for Free Games
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
Ronen Shaltiel
ICASSP
2009
IEEE
16 years 1 months ago
On ICA of improper and noncircular sources
We provide a review of independent component analysis (ICA) for complex-valued improper and noncircular random sources. An improper random signal is correlated with its complex co...
Peter J. Schreier, Tülay Adali, Louis L. Scha...
AUTONOMICS
2008
ACM
15 years 8 months ago
Emergent engineering for the management of complex situations
Ubiquitous computing and communication environments connect systems and people in unprecedented ways, but also fundamentally challenge the mindset of traditional systems engineeri...
René Doursat, Mihaela Ulieru
PIMRC
2008
IEEE
16 years 23 days ago
Bayesian inference in linear models with a random Gaussian matrix : Algorithms and complexity
—We consider the Bayesian inference of a random Gaussian vector in a linear model with a random Gaussian matrix. We review two approaches to finding the MAP estimator for this m...
Ido Nevat, Gareth W. Peters, Jinhong Yuan