2766 search results - page 135 / 554 » Algorithms for trigonometric polynomials |
145
click to vote
TCOM
2010
15 years 2 months ago
2010
—This paper deals with the case of a high speed mobile receiver operating in an orthogonal-frequency-divisionmultiplexing (OFDM) communication system. Assuming the knowledge of d...
113
click to vote
ALGORITHMICA
2008
15 years 4 months ago
2008
We provide sharp estimates for the probabilistic behaviour of the main parameters of the Euclid Algorithms, both on polynomials and on integer numbers. We study in particular the d...
131
click to vote
JSC
2010
15 years 2 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
113
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
108
click to vote
TCOM
2008
15 years 4 months ago
2008
The step size leading to the absolute minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a...