✦ LIBER ✦

An optimal corrector for a set of recognition algorithms

✍ Scribed by V.V. Krasnoproshin

Publisher: Elsevier Science
Year: 1979
Weight: 715 KB
Volume: 19
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(79)90079-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimization of key character set for wo

Optimization of key character set for word recognition using genetic algorithm

✍ Akira Suzuki; Yoshimasa Kimura; Sueharu Miyahara 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 845 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

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

An approach to the construction of optim

An approach to the construction of optimal recognition algorithms for large control tables

✍ A.G. Tserkovnyi 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 467 KB

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

An approach to optimization in a class o

An approach to optimization in a class of parametric recognition algorithms

✍ Yu.I. Zhuravlev; S.N. Miroshnik; S.M. Shvartin 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 646 KB