Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,247,734 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
Weighted Fuzzy Rule Interpolation Based on GA-Based Weight-Learning Techniques
Shyi-Ming Chen
,
Yu-Chuan Chang
IEEE transactions on fuzzy systems
2011
Corpus ID: 28444923
In this paper, we propose a weighted fuzzy interpolative reasoning method for sparse fuzzy rule-based systems. It is based on a…
Expand
Highly Cited
2009
Highly Cited
2009
Algorithm 891: A Fortran virtual memory system
J. Reid
,
J. Scott
TOMS
2009
Corpus ID: 11183419
Fortran_Virtual_Memory is a Fortran 95 package that provides facilities for reading from and writing to direct-access files. A…
Expand
Highly Cited
2005
Highly Cited
2005
On data gathering protocols for in-body biomedical sensor networks
M. Moh
,
B. J. Culpepper
,
Lan Dung
,
Teng-Sheng Moh
,
T. Hamada
,
Ching-Fong Su
GLOBECOM '05. IEEE Global Telecommunications…
2005
Corpus ID: 25264399
This paper investigates the effectiveness of data gathering protocols for in-body biomedical sensor networks. We studied the…
Expand
Highly Cited
2004
Highly Cited
2004
DAPR: a protocol for wireless sensor networks utilizing an application-based routing cost
M. Perillo
,
W. Heinzelman
IEEE Wireless Communications and Networking…
2004
Corpus ID: 5794285
As wireless sensor networks continue to attract more attention, new ideas for applications are continually being developed, many…
Expand
Highly Cited
2003
Highly Cited
2003
A novel DSR-based energy-efficient routing algorithm for mobile ad-hoc networks
J. Garcia
,
A. Kallel
,
Kyandoghere Kyamakya
,
K. Jobmann
,
Juan-Carlos Cano
,
P. Manzoni
IEEE 58th Vehicular Technology Conference. VTC…
2003
Corpus ID: 19388072
Mobile ad-hoc networks (MANETs) are wireless networks consisting of a collection of untethered nodes with no fixed infrastructure…
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
1992
Highly Cited
1992
The measured equation of invariance-a new concept in field computation
K. Mei
,
Rafael Pous
,
Zhaoqing Chen
,
Yaoqing Liu
IEEE Antennas and Propagation Society…
1992
Corpus ID: 123557331
Computations of electromagnetic fields are based either on differential equations or on integral equations. The differential…
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
1976
Highly Cited
1976
Sulphate–light scattering ratio as an index of the role of sulphur in tropospheric optics
A. Waggoner
,
A. J. VANDERPOL
,
R. Charlson
,
Steinar Larsen
,
L. Granat
,
Claes Trägårdh
Nature
1976
Corpus ID: 4170439
THE optical properties of the non-cloudy atmosphere are determined by a fixed component, the molecular gases, and a variable…
Expand
Highly Cited
1970
Highly Cited
1970
Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
F. Gustavson
,
W. Liniger
,
R. Willoughby
JACM
1970
Corpus ID: 8458097
An efficient implementation of the Crout elimination method in solving large sparse systems of linear algebraic equations 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