Sciweavers

5793 search results - page 144 / 1159
» Individual communication complexity
Sort
View
AUSDM
2008
Springer
227views Data Mining» more  AUSDM 2008»
15 years 8 months ago
Exploratory Mining over Organisational Communications Data
Exploratory data mining is fundamental to fostering an appreciation of complex datasets. For large and continuously growing datasets, such as obtained by regular sampling of an or...
Alan Allwright, John F. Roddick
FORTE
2009
15 years 4 months ago
Typing Component-Based Communication Systems
Abstract. Building complex component-based software systems, for instance communication systems based on the Click, Coyote, Appia, or Dream frameworks, can lead to subtle assemblag...
Michael Lienhardt, Claudio Antares Mezzina, Alan S...
ISCAS
2005
IEEE
182views Hardware» more  ISCAS 2005»
16 years 2 days ago
A new reconfigurable modem architecture for 3G multi-standard wireless communication systems
– The trend in communication systems is towards more rapidly changing specifications with shorter time intervals between updates of existing standards. This results in a coexiste...
Jung-Ho Kim, Dong Sam Ha, Jeffrey H. Reed
INFOCOM
2005
IEEE
16 years 2 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 10 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks