Sciweavers

724 search results - page 35 / 145
» Gossiping with Multiple Messages
Sort
View
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
15 years 3 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
WSNA
2003
ACM
15 years 2 months ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
DAIS
2011
14 years 1 months ago
Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
Amir H. Payberah, Jim Dowling, Seif Haridi
ICASSP
2011
IEEE
14 years 1 months ago
Graph-based sequential particle filtering in lossy networks: Single and multiple collaborative cameras
This paper presents a novel approach of multiple target tracking from multiple collaborative cameras. Firstly, particle filtering for conditional density propagation on graphs to...
Jing Huang, Dan Schonfeld
ICPP
1989
IEEE
15 years 1 months ago
Exploring "Multiple Worlds" in Parallel
We examine computing alternative solutions to a problem in parallel to improve response time. Problems with exploring multiple alternatives in parallel include (1) side-effects an...
Jonathan M. Smith, Gerald Q. Maguire Jr.