Synthesis of a correct recognition algorithm as a minimal covering construction problem

DOI10.1016/S0041-5553(83)80059-7zbMATH Open0552.68072MaRDI QIDQ3345804FDOQ3345804

I. V. Isaev

Publication date: 1983

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4031032
• Synthesis of recognition and classification algorithms by the covering method
• Algebraic-logic synthesis of correct recognition procedures based on elementary algorithms
• An efficient method for synthesizing correct recognition algorithms
• Methods of optimization and monotone correction in the algebraic approach to the recognition problem

zbMATH Keywords

minimal coveringrecognition algorithmclassification algorithmscorrect algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cited In (12)

• Methods of optimization and monotone correction in the algebraic approach to the recognition problem
• Title not available (Why is that?)
• The construction of a recognition algorithm in the algebraic closure.
• Synthesis of recognition and classification algorithms by the covering method
• Title not available (Why is that?)
• An efficient method for synthesizing correct recognition algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On minimal coverings of the space of classifications

This page was built for publication: Synthesis of a correct recognition algorithm as a minimal covering construction problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345804)