10608 search results - page 551 / 2122 » Complexity of O'Hara's Algorithm |
160
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
205
click to vote
VTC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper addresses the problem of joint linear transceiver design in the downlink of multiuser MIMO systems. We define the performance criterion as minimizing the maximal mea...
180
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
188
click to vote
CRYPTO
2007
Springer
16 years 1 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
154
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...