Efficient implementation of pattern recognition algorithms
    
    
  
  
  
      
      
      
        
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 8, pp. 1510-1516
    
  
  
  
  
  
    
      
      
        
      
      
      
    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.
            
            
            
          
        
      @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},
     publisher = {mathdoc},
     volume = {49},
     number = {8},
     year = {2009},
     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 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_8_a13/ LA - ru ID - ZVMMF_2009_49_8_a13 ER -
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/
