Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,239,550 papers from all fields of science
Search
Sign In
Create Free Account
Sparse matrix
Known as:
Dense matrix
, Sparse vector
, Sparsity
Expand
In numerical analysis, a sparse matrix is a matrix in which most of the elements are zero. By contrast, if most of the elements are nonzero, then the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
APMonitor
ARPACK
ASCEND
ASTAP
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Robust object tracking via sparsity-based collaborative model
Wei Zhong
,
Huchuan Lu
,
Ming-Hsuan Yang
IEEE Conference on Computer Vision and Pattern…
2012
Corpus ID: 15725489
In this paper we propose a robust object tracking algorithm using a collaborative model. As the main challenge for object…
Expand
Highly Cited
2011
Highly Cited
2011
Sparse Bayesian Methods for Low-Rank Matrix Estimation
S. D. Babacan
,
M. Luessi
,
R. Molina
,
A. Katsaggelos
IEEE Transactions on Signal Processing
2011
Corpus ID: 7921200
Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by…
Expand
Highly Cited
2010
Highly Cited
2010
On the Scalability of Hypergraph Models for Sparse Matrix Partitioning
B. Uçar
,
Ümit V. Çatalyürek
18th Euromicro Conference on Parallel…
2010
Corpus ID: 263721480
We investigate the scalability of the hypergraph-based sparse matrix partitioning methods with respect to the increasing sizes of…
Expand
Highly Cited
2010
Highly Cited
2010
Visual tracking decomposition
Junseok Kwon
,
Kyoung Mu Lee
IEEE Computer Society Conference on Computer…
2010
Corpus ID: 2164761
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and…
Expand
Highly Cited
2006
Highly Cited
2006
k-t SPARSE: High frame rate dynamic MRI exploiting spatio-temporal sparsity
M. Lustig
,
Juan M. Santos
,
D. Donoho
,
J. Pauly
2006
Corpus ID: 7423510
M. Lustig, J. M. Santos, D. L. Donoho, J. M. Pauly Electrical Engineering, Stanford University, Stanford, CA, United States…
Expand
Highly Cited
2006
Highly Cited
2006
Underdetermined blind source separation based on sparse representation
Yuanqing Li
,
S. Amari
,
A. Cichocki
,
D. Ho
,
S. Xie
IEEE Transactions on Signal Processing
2006
Corpus ID: 9097888
This paper discusses underdetermined (i.e., with more sources than sensors) blind source separation (BSS) using a two-stage…
Expand
Highly Cited
2005
Highly Cited
2005
Sparse Matrix-Vector multiplication on FPGAs
Ling Zhuo
,
V. Prasanna
Symposium on Field Programmable Gate Arrays
2005
Corpus ID: 266258
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering…
Expand
Highly Cited
2005
Highly Cited
2005
The Empirical Risk-Return Relation: A Factor Analysis Approach
Serena Ng
,
S. Ludvigson
2005
Corpus ID: 17295328
A key criticism of the existing empirical literature on the risk-return relation relates to the relatively small amount of…
Expand
Highly Cited
1997
Highly Cited
1997
Approximating Nature's Variation: Selecting and Using Reference Information in Restoration Ecology
P. White
,
Joan L. Walker
1997
Corpus ID: 43387031
Restoration ecologists use reference information to define restoration goals, determine the restoration potential of sites, and…
Expand
Highly Cited
1991
Highly Cited
1991
FastCap: a multipole accelerated 3-D capacitance extraction program
K. Nabors
,
Jacob K. White
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1991
Corpus ID: 6054681
A fast algorithm for computing the capacitance of a complicated three-dimensional geometry of ideal conductors in a uniform…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE