8669 search results - page 115 / 1734 » Computing matrix representations |
ICMCS
2009
IEEE
13 years 6 months ago
2009
IEEE
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Covariance matrix tapering (CMT) is a popular approach to improve the robustness of adaptive beamformers against moving or wideband interferers. In this paper, we develop a comput...
SAINT
2005
IEEE
14 years 2 months ago
2005
IEEE
Stochastic bounds are a promising method to analyze QoS requirements. Indeed it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, the...
ICCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The innovation of this work is a simple vectorizable algorithm for performing sparse matrix vector multiply in compressed sparse row (CSR) storage format. Unlike the vect...
FPL
2004
Springer
14 years 2 months ago
2004
Springer
The paper describes two methods for the design of matrix-oriented SAT solvers based on data compression. The first one provides matrix compression in a host computer and decompress...