A correct model of regonition algorithms of bounded capacity, based on the concept of potential

DOI10.1016/S0041-5553(83)80142-6zbMATH Open0552.68075OpenAlexW2071327243MaRDI QIDQ3345808FDOQ3345808

Authors: Sh. U. Bekirov 

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/s0041-5553(83)80142-6

Recommendations

• scientific article; zbMATH DE number 3858454
• Pattern recognition algorithms' models based on potential principles
• scientific article; zbMATH DE number 4066381
• The construction of a recognition algorithm in the algebraic closure.
• scientific article; zbMATH DE number 4187136

zbMATH Keywords

algebraic closurerecognition algorithmsparametric modelpattern recognition training

Mathematics Subject Classification ID

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

Cited In (4)

• A fixed rehearsal capacity interpretation of limits on absolute identification performance
• Title not available (Why is that?)
• Pattern recognition algorithms' models based on potential principles
• The capacity of polynomial expansions of a set of algorithms for calculating estimates

This page was built for publication: A correct model of regonition algorithms of bounded capacity, based on the concept of potential

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