Sciweavers

489 search results - page 48 / 98
» Communication Complexity of Permutation-Invariant Functions
Sort
View
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
15 years 4 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
15 years 5 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
GLOBECOM
2009
IEEE
15 years 1 months ago
Compressed Sensing Reception of Bursty UWB Impulse Radio is Robust to Narrow-Band Interference
—We have recently proposed a novel receiver for Ultra-Wide-band Impulse-Radio communication in bursty applications like Wireless Sensor Networks. The receiver, based on the princ...
Anand Oka, Lutz H.-J. Lampe
CNSR
2005
IEEE
210views Communications» more  CNSR 2005»
15 years 20 days ago
A Framework for Self-Management of Hybrid Wireless Networks Using Autonomic Computing Principles
The dramatic increase in the number of mobile subscribers has put a significant resource and service provisioning strain on current cellular networks in particular in terms of mu...
Chong Shen, Dirk Pesch, James Irvine
AINTEC
2007
Springer
15 years 4 months ago
Gap Analysis in IP Multicast Dissemination
Abstract. IP multicast is advantageous for high quality streaming applications and future needs in the Internet. However, it is generally recognized that IP multicast requires sign...
Hitoshi Asaeda, Bill Manning