145 search results - page 3 / 29 » Fast, Randomized Join-Order Selection - Why Use Transformati... |
171
Voted
STOC
2012
ACM
13 years 4 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
121
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
146
click to vote
ACMSE
2006
ACM
15 years 6 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
153
Voted
ICIP
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper describes an efficient feature selection method that quickly selects a small subset out of a given huge feature set; for building robust object detection systems. In th...
120
click to vote
DCC
2010
IEEE
15 years 9 months ago
2010
IEEE
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...