Sciweavers

130 search results - page 15 / 26
» The Quantum Communication Complexity of Sampling
Sort
View
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
14 years 20 days ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
CN
2010
120views more  CN 2010»
13 years 11 months ago
A survey on bio-inspired networking
The developments in the communication and networking technologies have yielded many existing and envisioned information network architectures such as cognitive radio networks, sen...
Falko Dressler, Özgür B. Akan
INFOCOM
2008
IEEE
14 years 5 months ago
Complex Network Measurements: Estimating the Relevance of Observed Properties
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...
Matthieu Latapy, Clémence Magnien
GLOBECOM
2007
IEEE
14 years 2 months ago
Complex Nakagami Channel Simulator with Accurate Phase and Auto-Correlation Properties
Accurate and systematic channel simulation technique is critical for performance verification of digital transceiver design over wireless channels. Despite the abundant results on ...
Yao Ma, Dongbo Zhang
ICC
2007
IEEE
14 years 5 months ago
Widely Linear Prediction for Blind Equalization
— This paper proposes a new blind equalization scheme based on widely linear (WL) prediction. It permits to compensate non-minimum phase channels with or without spectral nulls, ...
Francisco J. A. de Aquino, Carlos A. F. da Rocha, ...