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
2011
Highly Cited
2011
Abstract : Recently, sparse representation has been applied to visual tracking to find the target with the minimum reconstruction… 
Highly Cited
2010
Highly Cited
2010
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into… 
Highly Cited
2007
Highly Cited
2007
This article proposes an active basis model and a shared pursuit algorithm for learning deformable templates from image patches… 
Highly Cited
2006
Highly Cited
2006
This paper discusses a computer vision algorithm and a control law for obstacle avoidance for small unmanned air vehicles using a… 
Highly Cited
2005
Highly Cited
2005
The time-of-flight (TOF) principle is a well known principle to acquire a scene in all three dimensions. The advantages of the… 
Highly Cited
2000
Highly Cited
2000
The equation b = Ax + n where the columns of A form an overcomplete set, i.e. the system is underdetermined, and with a sparsity… 
Highly Cited
1995
Highly Cited
1995
The authors evaluate continuous density hidden Markov models (CDHMM), dynamic time warping (DTW) and distortion-based vector… 
Highly Cited
1990
Highly Cited
1990
It is difficult to estimate the probability of a word's context because of sparse data problems. If appropriate care is taken, we… 
Highly Cited
1986
Highly Cited
1986
Highly Cited
1983
Highly Cited
1983
Large sparse linear systems of equations require hours to solve on conventional mainframe computers: however, with the advent of…