𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reducing the computational requirements of the minimum-distance classifier

✍ Scribed by Michael E. Hodgson

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
654 KB
Volume
25
Category
Article
ISSN
0034-4257

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Reducing the computational requirements
Reducing the computational requirements of the differential quadrature method
✍ Wen Chen; Yongxi Yu; Xinwei Wang πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 603 KB

This article shows that the weighting coefficient matrices of the differential quadrature method (DQM) are centrosymmetric or skew-centrosymmetric, if the grid spacings are symmetric irrespective of whether they are equal or unequal. A new skew centrosymmetric matrix is also discussed. The applicati

Reducing the computational requirements
Reducing the computational requirements of time-reversal device optimizations
✍ Ian Scott; Ana Vukovic; Phillip Sewell πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract Time‐reversal simulations using conventional numerical algorithms provide the basis for a simple component optimization procedure. However, the computational requirements of the approach can become excessive, requiring the recording of the complete field time histories on a surface surr

On computing the minimum distance of lin
On computing the minimum distance of linear codes
✍ Masami Mohri; Masakatu Morii πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 245 KB πŸ‘ 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po