186 search results - page 7 / 38 » Fast Computation of Sparse Datacubes |
HPCC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
JCPHY
2011
12 years 11 months ago
2011
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
ICMCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...