Sciweavers

1528 search results - page 192 / 306
» On Signatures for Communication Graphs
Sort
View
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
13 years 9 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 9 months ago
Random Linear Network Coding: A free cipher?
Abstract— We consider the level of information security provided by random linear network coding in network scenarios in which all nodes comply with the communication protocols y...
Luísa Lima, Muriel Médard, Joã...
ALGOSENSORS
2010
Springer
13 years 8 months ago
MSDR-D Network Localization Algorithm
Abstract. We present a distributed multi-scale dead-reckoning (MSDR-D) algorithm for network localization that utilizes local distance and angular information for nearby sensors. T...
Kevin Coogan, Varun Khare, Stephen G. Kobourov, Ba...
IPL
2011
88views more  IPL 2011»
13 years 4 months ago
Smooth movement and Manhattan path based Random Waypoint mobility
In this paper, we study the stationary node distribution of a variation of the Random Waypoint mobility model, in which nodes move in a smooth way following one randomly chosen Ma...
Pilu Crescenzi, Miriam Di Ianni, Andrea Marino, Do...
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 9 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan