186 search results - page 3 / 38 » Fast Computation of Sparse Datacubes |
VLDB
2001
ACM
14 years 29 days ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
WAW
2004
Springer
14 years 1 months ago
2004
Springer
ystem (Extended Abstract) Gianna M. Del Corso1 Antonio Gull´ı1,2 Francesco Romani1 1 Dipartimento di Informatica, University of Pisa, Italy 2 IIT-CNR, Pisa
ICIP
2010
IEEE
13 years 6 months ago
2010
IEEE
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
STOC
2012
ACM
11 years 11 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...