501 search results - page 65 / 101 » Communication Lower Bounds Using Dual Polynomials |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each prima...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
QEST
2008
IEEE
14 years 3 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...