Sciweavers

2924 search results - page 292 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICC
2007
IEEE
114views Communications» more  ICC 2007»
15 years 8 months ago
Channel-Matched Spreading Codes for the Downlink of MC-CDMA
Abstract-- This paper concerns the multiple access performance of spreading codes used in the downlink of multicarrier code-division multiple-access (MC-CDMA). Complex-valued sprea...
Qinghua Shi, Yong Liang Guan, Choi Look Law
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 8 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
UAI
2003
15 years 5 months ago
Bayesian Hierarchical Mixtures of Experts
The Hierarchical Mixture of Experts (HME) is a well-known tree-structured model for regression and classification, based on soft probabilistic splits of the input space. In its o...
Christopher M. Bishop, Markus Svensén
DC
2007
15 years 4 months ago
The overhead of consensus failure recovery
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
Partha Dutta, Rachid Guerraoui, Idit Keidar
INFOCOM
2010
IEEE
15 years 2 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis