6 search results - page 1 / 2 » Efficient discrete fractional Hirschman optimal transform an... |
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...
CCGRID
2011
IEEE
12 years 8 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
The Discrete Wavelet Transform is a proven tool for a wide range of database applications. However, despite broad acceptance, some of its properties have not been fully explored a...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
ICMCS
2009
IEEE
13 years 2 months ago
2009
IEEE
We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-sup...