441 search results - page 37 / 89 » Sparse Recovery Using Sparse Random Matrices |
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- Recovering or estimating the initial state of a highdimensional system can require a potentially large number of measurements. In this paper, we explain how this burden ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
112
click to vote
FPGA
2000
ACM
15 years 1 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
112
click to vote
JMLR
2012
13 years 10 days ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
JPDC
2008
14 years 9 months ago
2008
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...