Sciweavers

2924 search results - page 327 / 585
» Lower Bounds in Distributed Computing
Sort
View
JSAC
2008
117views more  JSAC 2008»
15 years 4 months ago
A design framework for limited feedback MIMO systems with zero-forcing DFE
Abstract--We consider the design of multiple-input multipleoutput communication systems with a linear precoder at the transmitter, zero-forcing decision feedback equalization (ZFDF...
Michael Botros Shenouda, Timothy N. Davidson
JMLR
2010
140views more  JMLR 2010»
14 years 11 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
128
Voted
DCC
2009
IEEE
16 years 5 months ago
Compressive-Projection Principal Component Analysis and the First Eigenvector
An analysis is presented that extends existing Rayleigh-Ritz theory to the special case of highly eccentric distributions. Specifically, a bound on the angle between the first Rit...
James E. Fowler
PODC
2005
ACM
15 years 10 months ago
On reliable broadcast in a radio network
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
Vartika Bhandari, Nitin H. Vaidya
PODC
1997
ACM
15 years 8 months ago
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
We describe an ejjicient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds simdar to WFQ, along with throughput fairness. Our scheme can be im...
Subhash Suri, George Varghese, Girish P. Chandranm...