✦ LIBER ✦

On the synthesis of classifying algorithms in finite sets of classification algorithms (taxonomy)

✍ Scribed by V.V. Ryazanov

Publisher: Elsevier Science
Year: 1982
Weight: 727 KB
Volume: 22
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(82)90049-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The committee synthesis of recognition a

The committee synthesis of recognition and classification algorithms

✍ V.V Ryazanov 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 624 KB

Synthesis of recognition and classificat

Synthesis of recognition and classification algorithms by the covering method

✍ I.V. Isaev 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 587 KB

Optimization of the weighting factors in

Optimization of the weighting factors in recognition algorithms with representative sets

✍ S.V. Trofimov 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 261 KB

Improved parallel algorithms for the cla

Improved parallel algorithms for the classification of electroencephalograms (EEGs) on the DAP510

✍ W. Erhard; A. Grefe 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 338 KB

A note on finite termination of iterativ

A note on finite termination of iterative algorithms in mathematical programming

✍ Jinchuan Zhou; Changyu Wang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 610 KB

Two well-known results on the unified treatment of finite termination of a class of algorithms for solving convex programming problems and for solving variational inequality problems are reconsidered. In particular, some of the underlying assumptions employed in the existing literature are shown to

On the synthesis of fast algorithms for

On the synthesis of fast algorithms for signal processing

✍ O.M. Makarov 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 266 KB