Sciweavers

143 search results - page 3 / 29
» Quick Approximation to Matrices and Applications
Sort
View
MCS
2008
Springer
13 years 6 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich
ICASSP
2010
IEEE
13 years 7 months ago
Kronecker product matrices for compressive sensing
Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on...
Marco F. Duarte, Richard G. Baraniuk
MSS
2008
IEEE
93views Hardware» more  MSS 2008»
13 years 6 months ago
Deriving weights from general pairwise comparison matrices
The problem of deriving weights from pairwise comparison matrices has been treated extensively in the literature. Most of the results are devoted to the case when the matrix under...
Nikolai V. Hovanov, James W. Kolari, Mikhail V. So...
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
13 years 7 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
Jinsong Tan, Louxin Zhang
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
14 years 3 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...