Sciweavers

1734 search results - page 248 / 347
» MSDR-D Network Localization Algorithm
Sort
View
155
Voted
TSP
2010
14 years 9 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
109
Voted
DMSN
2009
ACM
15 years 9 months ago
FSort: external sorting on flash-based sensor devices
In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when ...
Panayiotis Andreou, Orestis Spanos, Demetrios Zein...
ICAPR
2005
Springer
15 years 8 months ago
GP Ensemble for Distributed Intrusion Detection Systems
In this paper an intrusion detection algorithm based on GP ensembles is proposed. The algorithm runs on a distributed hybrid multiisland model-based environment to monitor security...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
15 years 7 months ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
110
Voted
SPDP
1993
IEEE
15 years 6 months ago
Fast Rehashing in PRAM Emulations
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
J. Keller