Sciweavers

22 search results - page 2 / 5
» Optimizing Near Duplicate Detection for P2P Networks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICON
2007
IEEE
13 years 11 months ago
Fast Duplicate Address Detection for Mobile IPv6
Several components contribute to handover delay of Mobile IPv6, namely, movement detection time, address configuration time, binding registration time, and route optimization time....
Panita Pongpaibool, Pahol Sotthivirat, Sukumal I. ...
CIIT
2007
195views Communications» more  CIIT 2007»
13 years 6 months ago
Using a cache scheme to detect selfish nodes in mobile ad hoc networks
This paper presents a hardware based cache scheme to detect selfish nodes in mobile ad hoc network. In this scheme, the hardware monitors the activities of the upperlayer software...
H. Lin, José G. Delgado-Frias, Sirisha Medi...
IPSN
2007
Springer
13 years 11 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 5 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...