✦ LIBER ✦

Problem of selecting a recognition algorithm in a class of voting algorithms

✍ Scribed by A. B. Doktorovich

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 416 KB
Volume: 10
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071556

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Selection of the optimal algorithm in a

Selection of the optimal algorithm in a class of recognition algorithms

✍ T.L. Slutskaya 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 732 KB

Optimization of a class of recognition a

Optimization of a class of recognition algorithms

✍ E.G. Kul'yanov 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 759 KB

Construction of a correct taxonomy algor

Construction of a correct taxonomy algorithm in expansions of the a class of recognition algorithms

✍ A.F. Mukhamedgaliev 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 288 KB

The completeness of a f&mily of taxonomy algorithms, represented in the form of two interconnected subfamilies, is considered. While constructing the algorithms, defining the completeness of each subfamily, it is snown that a correct algorithm exists in the class of recognition algorithms of the es

The absolute recognition of objects in a

The absolute recognition of objects in a class of algorithms

✍ S.N. Miroshnik 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 556 KB

Some geometrical problems involved in es

Some geometrical problems involved in estimating the accuracy of a class of recognition algorithms

✍ Bakh Hung Khang 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 727 KB

The asymptotic properties of a class of

The asymptotic properties of a class of recognition algorithms

✍ S.A. Yakovlev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 433 KB