2920 search results - page 418 / 584 » Finite information logic |
190
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
158
click to vote
TIT
2008
15 years 6 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
178
click to vote
TSP
2008
15 years 6 months ago
2008
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
204
click to vote
BMCBI
2002
15 years 6 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
184
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...