186 search results - page 9 / 38 » Fast Computation of Sparse Datacubes |
WADS
1995
Springer
14 years 2 days ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
PC
2002
13 years 8 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
ICCV
2009
IEEE
13 years 6 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...