145 search results - page 3 / 29 » Fast, Randomized Join-Order Selection - Why Use Transformati... |
STOC
2012
ACM
11 years 10 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...
STOC
2009
ACM
14 years 8 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 ...
ACMSE
2006
ACM
13 years 11 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...
ICIP
2006
IEEE
14 years 9 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...
DCC
2010
IEEE
14 years 2 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...