Sciweavers

417 search results - page 12 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
PODC
2003
ACM
14 years 24 days ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
BROADNETS
2004
IEEE
13 years 11 months ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 7 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
EDBT
2004
ACM
174views Database» more  EDBT 2004»
14 years 7 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
CAINE
2008
13 years 9 months ago
New Architecture and Protocols for Global-Scale Machine Communities
This article is about the new universal architecture which allows electronic devices of different functionalities and manufacturers, as well as on-line services, to seamlessly int...
Vladimir Krylov, N. Mikhaylov, Dmitry V. Ponomarev