Sciweavers

608 search results - page 30 / 122
» Random Systems with Complete Connections
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 11 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
SPAA
2005
ACM
14 years 3 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
IROS
2008
IEEE
108views Robotics» more  IROS 2008»
14 years 4 months ago
A random set formulation for Bayesian SLAM
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
John Mullane, Ba-Ngu Vo, Martin David Adams, Wijer...
DSN
2005
IEEE
14 years 3 months ago
A System Demonstration of ST-TCP
ST-TCP (Server fault-Tolerant TCP) is an extension of TCP to tolerate TCP server failures. Server fault tolerance is provided by using an active-backup server that keeps track of ...
Manish Marwah, Shivakant Mishra, Christof Fetzer
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 9 months ago
Techniques for Enhanced Physical-Layer Security
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
Pedro C. Pinto, João Barros, Moe Z. Win