Sciweavers

236 search results - page 15 / 48
» Fast Sparse Matrix Multiplication
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Robust speech dereverberation based on non-negativity and sparse nature of speech spectrograms
This paper presents a blind dereverberation method designed to recover the subband envelope of an original speech signal from its reverberant version. The problem is formulated as...
Hirokazu Kameoka, Tomohiro Nakatani, Takuya Yoshio...
FOCS
2005
IEEE
14 years 1 months ago
Group-theoretic Algorithms for Matrix Multiplication
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
Henry Cohn, Robert D. Kleinberg, Balázs Sze...
ECCC
2006
70views more  ECCC 2006»
13 years 7 months ago
Finding a Heaviest Triangle is not Harder than Matrix Multiplication
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
Artur Czumaj, Andrzej Lingas
ICASSP
2011
IEEE
12 years 11 months ago
Multiple-Measurement Vector model and its application to Through-the-Wall Radar Imaging
This paper addresses the problem of Through-the-Wall Radar Imaging (TWRI) using the Multiple-Measurement Vector (MMV) compressive sensing model. TWR image formation is reformulate...
Jie Yang, Abdesselam Bouzerdoum, Fok Hing Chi Tivi...
EUROPAR
2003
Springer
14 years 19 days ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro