4047 search results - page 295 / 810 » The Discrete Basis Problem |
158
click to vote
PACT
2009
Springer
15 years 11 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
131
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
125
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
In H.264/AVC [1], integer transforms are applied instead of the 8×8 discrete cosine transform (DCT) of previous standards to avoid inverse transform mismatch problems. However, th...
149
click to vote
INDOCRYPT
2001
Springer
15 years 9 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
139
click to vote
COMPGEOM
1999
ACM
15 years 9 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...