Testing the performance of some nonparametric pattern recognition algorithms in realistic cases

Author： Sandri L.   Marzocchi W.  

Publisher： Elsevier

ISSN： 0031-3203

Source： Pattern Recognition, Vol.37, Iss.3, 2004-03, pp. : 447-461

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Lower bounds for the rate of convergence in nonparametric pattern recognition

By Antos A.  

Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. : 3-24

Elsevier

Access to resources Recommend Favorite

Scalable Parallel Algorithms for Geometric Pattern Recognition

By Boxer L.   Miller R.   Rau-Chaplin A.  

Journal of Parallel and Distributed Computing, Vol. 58, Iss. 3, 1999-09 ,pp. : 466-486

Academic Press

Access to resources Recommend Favorite

A Comparative Study of Pattern Recognition Algorithms for Classification of Ultrasonic Signals

By Anastassopoulos A.A.   Nikolaidis V.N.   Philippidis T.P.  

Neural Computing & Applications, Vol. 8, Iss. 1, 1999-03 ,pp. : 53-66

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for Testing Satisfiability Formulas

By Vlada M.  

Artificial Intelligence Review, Vol. 15, Iss. 3, 2001-05 ,pp. : 153-163

Springer Publishing Company

Access to resources Recommend Favorite

Parameterized Pattern Matching: Algorithms and Applications

By Baker B.S.  

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 28-42

Academic Press

Access to resources Recommend Favorite