Sciweavers

4616 search results - page 247 / 924
» The Communication Complexity of Correlation
Sort
View
IATA
1998
Springer
15 years 11 months ago
A Dynamic Hierarchy of Intelligent Agents for Network Management
Routing as well as the management of communicationnetworks that support hybrid types of communications requiring quality of service is a very hard problem. We present here a frame...
Christian Frei, Boi Faltings
159
Voted
JDA
2008
85views more  JDA 2008»
15 years 6 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
ECCC
2010
98views more  ECCC 2010»
15 years 6 months ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
Amit Chakrabarti
192
Voted
SPAA
2009
ACM
16 years 1 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
ICC
2009
IEEE
109views Communications» more  ICC 2009»
16 years 1 months ago
Measurement-Based Modeling of Vehicle-to-Vehicle MIMO Channels
— Vehicle-to-vehicle (VTV) communications are of interest for applications within traffic safety and congestion avoidance, but the development of suitable communications systems...
Johan Karedal, Fredrik Tufvesson, Nicolai Czink, A...