Sciweavers

661 search results - page 44 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
CCS
2003
ACM
15 years 9 months ago
Establishing pairwise keys in distributed sensor networks
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. Ho...
Donggang Liu, Peng Ning
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 4 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 9 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
ICNP
2003
IEEE
15 years 9 months ago
Mobile Distributed Information Retrieval for Highly-Partitioned Networks
We propose and evaluate a mobile, peer-to-peer Information Retrieval system. Such a system can, for example, support medical care in a disaster by allowing access to a large colle...
Katrina M. Hanna, Brian Neil Levine, R. Manmatha
PERCOM
2006
ACM
16 years 3 months ago
A Collusion Attack on Pairwise Key Predistribution Schemes for Distributed Sensor Networks
Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback ...
Tyler Moore