Geodesic
Efficient implementation of pattern recognition algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 8, pp. 1510-1516 
P. A. Karpovich. Efficient implementation of pattern recognition algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 8, pp. 1510-1516. http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_8_a13/
@article{ZVMMF_2009_49_8_a13,
     author = {P. A. Karpovich},
     title = {Efficient implementation of pattern recognition algorithms},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1510--1516},
     year = {2009},
     volume = {49},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_8_a13/}
}
TY  - JOUR
AU  - P. A. Karpovich
TI  - Efficient implementation of pattern recognition algorithms
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2009
SP  - 1510
EP  - 1516
VL  - 49
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_8_a13/
LA  - ru
ID  - ZVMMF_2009_49_8_a13
ER  - 
%0 Journal Article
%A P. A. Karpovich
%T Efficient implementation of pattern recognition algorithms
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2009
%P 1510-1516
%V 49
%N 8
%U http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_8_a13/
%G ru
%F ZVMMF_2009_49_8_a13

Voir la notice de l'article provenant de la source Math-Net.Ru

The model of estimation algorithms designed for pattern recognition is considered. A partial order for a class of systems of support sets that admit an efficient implementation is defined and investigated. It is proved that the problem of finding a counterexample for the efficiency property with additional constraints is NP-complete.

[1] Zhuravlev Yu. I., “Ob algebraicheskom podkhode k resheniyu zadach raspoznavaniya obrazov ili klassifikatsii”, Probl. kibernetiki, 33, Nauka, M., 1978, 5–68

[2] Zhuravlev Yu.I., “Korrektnye algoritmy nad mnozhestvom nekorrektnykh (evristicheskikh) algoritmov. I”, Kibernetika, 1977, no. 4, 5–17

[3] Zhuravlev Yu. I., “Korrektnye algoritmy nad mnozhestvom nekorrektnykh (evristicheskikh) algoritmov. II”, Kibernetika, 1977, no. 6, 21–27 | Zbl

[4] Aleksanyan A. A., Zhuravlev Yu. I., “Ob odnom podkhode k voprosu postroeniya effektivnykh algoritmov raspoznavaniya”, Zh. vychisl. matem. i matem. fiz., 25:2 (1985), 283–291 | MR | Zbl

[5] Dyakonov A. G., “O vybore sistemy opornykh mnozhestv dlya effektivnoi realizatsii algoritmov raspoznavaniya tipa vychisleniya otsenok”, Zh. vychisl. matem. i matem. fiz., 40:7 (2000), 1104–1118 | MR

[6] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Nauka, M., 1982 | MR