Sciweavers

1612 search results - page 110 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
TWC
2008
133views more  TWC 2008»
15 years 2 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
JAL
2002
113views more  JAL 2002»
15 years 2 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
RSA
1998
93views more  RSA 1998»
15 years 2 months ago
Parallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
ICDCS
2009
IEEE
15 years 11 months ago
The Impact of Communication Models on Routing-Algorithm Convergence
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network...
Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. W...
ICASSP
2011
IEEE
14 years 6 months ago
Optimal SIR algorithm vs. fully adapted auxiliary particle filter: A matter of conditional independence
Particle filters (PF) and auxiliary particle filters (APF) are widely used sequential Monte Carlo (SMC) techniques. In this paper we comparatively analyse the Sampling Importanc...
François Desbouvries, Yohan Petetin, Emmanu...