524 search results - page 74 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We investigate prediction algorithms that exploit both temporal and spatial correlations in MIMO correlated narrowband fading wireless channels. We first derive the optimal tw...
TSP
2010
13 years 2 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
CEC
2010
IEEE
12 years 11 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
SIROCCO
2004
13 years 9 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...