Skip to search formSkip to main contentSkip to account menu

Sparse matrix

Known as: Dense matrix, Sparse vector, Sparsity 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
In this paper we propose a robust object tracking algorithm using a collaborative model. As the main challenge for object… 
Highly Cited
2011
Highly Cited
2011
Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by… 
Highly Cited
2010
Highly Cited
2010
We investigate the scalability of the hypergraph-based sparse matrix partitioning methods with respect to the increasing sizes of… 
Highly Cited
2010
Highly Cited
2010
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and… 
Highly Cited
2006
Highly Cited
2006
M. Lustig, J. M. Santos, D. L. Donoho, J. M. Pauly Electrical Engineering, Stanford University, Stanford, CA, United States… 
Highly Cited
2006
Highly Cited
2006
This paper discusses underdetermined (i.e., with more sources than sensors) blind source separation (BSS) using a two-stage… 
Highly Cited
2005
Highly Cited
2005
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering… 
Highly Cited
2005
Highly Cited
2005
A key criticism of the existing empirical literature on the risk-return relation relates to the relatively small amount of… 
Highly Cited
1997
Highly Cited
1997
Restoration ecologists use reference information to define restoration goals, determine the restoration potential of sites, and… 
Highly Cited
1991
Highly Cited
1991
A fast algorithm for computing the capacitance of a complicated three-dimensional geometry of ideal conductors in a uniform…