467 search results - page 6 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
This paper proposes a method to estimate the parameters of the relative phase probability density function (RP pdf) of the complex coefficients when the image is corrupted by add...
JAT
2010
13 years 2 months ago
2010
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
CMA
2010
13 years 4 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...