Sciweavers

903 search results - page 33 / 181
» On the reduction of a random basis
Sort
View
TSP
2008
106views more  TSP 2008»
15 years 1 months ago
Identification of Matrices Having a Sparse Representation
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
Götz E. Pfander, Holger Rauhut, Jared Tanner
JMIV
2002
72views more  JMIV 2002»
15 years 1 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
ICASSP
2011
IEEE
14 years 5 months ago
Generalized Restricted Isometry Property for alpha-stable random projections
The Restricted Isometry Property (RIP) is an important concept in compressed sensing. It is well known that many random matrices satisfy the RIP with high probability, whenever th...
Daniel Otero, Gonzalo R. Arce
DATE
2007
IEEE
118views Hardware» more  DATE 2007»
15 years 8 months ago
Statistical model order reduction for interconnect circuits considering spatial correlations
In this paper, we propose a novel statistical model order reduction technique, called statistical spectrum model order reduction (SSMOR) method, which considers both intra-die and...
Jeffrey Fan, Ning Mi, Sheldon X.-D. Tan, Yici Cai,...
JCO
2010
101views more  JCO 2010»
15 years 11 days ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier