Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,616,432 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
2011
Highly Cited
2011
Minimum Error Bounded Efficient L1 Tracker with Occlusion Detection (PREPRINT)
Xue Mei
,
Haibin Ling
,
Yi Wu
,
Erik Blasch
,
L. Bai
2011
Corpus ID: 60019217
Abstract : Recently, sparse representation has been applied to visual tracking to find the target with the minimum reconstruction…
Expand
Highly Cited
2010
Highly Cited
2010
Optimum Subspace Learning and Error Correction for Tensors
Yin Li
,
Junchi Yan
,
Yue Zhou
,
Jie Yang
European Conference on Computer Vision
2010
Corpus ID: 16156537
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into…
Expand
Highly Cited
2007
Highly Cited
2007
Deformable Template As Active Basis
Y. Wu
,
Zhangzhang Si
,
Chuck Fleming
,
Song-Chun Zhu
IEEE International Conference on Computer Vision
2007
Corpus ID: 3098706
This article proposes an active basis model and a shared pursuit algorithm for learning deformable templates from image patches…
Expand
Highly Cited
2006
Highly Cited
2006
Obstacle Avoidance For Unmanned Air Vehicles Using Image Feature Tracking
B. Call
,
R. Beard
,
Clark N. Taylor
,
Blake Barber
2006
Corpus ID: 14254014
This paper discusses a computer vision algorithm and a control law for obstacle avoidance for small unmanned air vehicles using a…
Expand
Highly Cited
2005
Highly Cited
2005
Novel pixel architecture with inherent background suppression for 3D time-of-flight imaging
T. Oggier
,
R. Kaufmann
,
+7 authors
N. Blanc
2005
Corpus ID: 121819064
The time-of-flight (TOF) principle is a well known principle to acquire a scene in all three dimensions. The advantages of the…
Expand
Highly Cited
2000
Highly Cited
2000
FRAME DESIGN USING FOCUSS WITH METHOD OF OPTIMAL DIRECTIONS (MOD)
Høgskolen i Stavanger
2000
Corpus ID: 1743446
The equation b = Ax + n where the columns of A form an overcomplete set, i.e. the system is underdetermined, and with a sparsity…
Expand
Highly Cited
1995
Highly Cited
1995
Speaker recognition using hidden Markov models, dynamic time warping and vector quantisation
K. Yu
,
J. Mason
,
J. Oglesby
1995
Corpus ID: 15082685
The authors evaluate continuous density hidden Markov models (CDHMM), dynamic time warping (DTW) and distortion-based vector…
Expand
Highly Cited
1990
Highly Cited
1990
Poor Estimates of Context are Worse than None
W. Gale
,
Kenneth Ward Church
Human Language Technology - The Baltic Perspectiv
1990
Corpus ID: 10164826
It is difficult to estimate the probability of a word's context because of sparse data problems. If appropriate care is taken, we…
Expand
Highly Cited
1986
Highly Cited
1986
Direct methods for sparse matrices27100
I. Duff
,
A. Erisman
,
J. Reid
1986
Corpus ID: 124271328
Highly Cited
1983
Highly Cited
1983
Iterative algorithms for large sparse linear systems on parallel computers
L. Adams
1983
Corpus ID: 122343203
Large sparse linear systems of equations require hours to solve on conventional mainframe computers: however, with the advent of…
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