Sciweavers

347 search results - page 29 / 70
» On private computation in incomplete networks
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Network Extractor Protocols
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...
Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerm...
MINENET
2006
ACM
14 years 1 months ago
Privacy-preserving performance measurements
Internet performance is an issue of great interest, but it is not trivial to measure. A number of commercial companies try to measure this, as does RIPE, and many individual Inter...
Matthew Roughan, Yin Zhang
AUTOMATICA
2010
95views more  AUTOMATICA 2010»
13 years 7 months ago
Sufficient conditions for connectivity maintenance and rendezvous in leader-follower networks
In this paper we derive a set of constraints that are sufficient to guarantee maintained connectivity in a leader-follower multiagent network with proximity based communication to...
Tove Gustavi, Dimos V. Dimarogonas, Magnus Egerste...
CDC
2008
IEEE
122views Control Systems» more  CDC 2008»
14 years 2 months ago
On the number of leaders needed to ensure network connectivity
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...
Dimos V. Dimarogonas, Tove Gustavi, Magnus Egerste...
ICASSP
2009
IEEE
14 years 2 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...