2168 search results - page 143 / 434 » Randomized Algorithms and Complexity Theory |
156
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
137
Voted
TWC
2008
15 years 3 months ago
2008
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,...
148
click to vote
PODC
2003
ACM
15 years 8 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
124
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
151
Voted
ANTS
1998
Springer
15 years 7 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...