( en | de | ru )

 

Disambiguation of "Oncina, José"

Author of the publication

copydeleteadd this publication to your clipboard
Comparison of fast nearest neighbour classifiers for handwritten character recognition.

, and . Pattern Recognit. Lett., 19 (3-4): 351-356 (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Humberto Jorge José

Nadine José Gonzalez

José Navarrete

José Baena

José Teixeira

 

Other publications of authors with the same name

Interactive Structured Output Prediction: Application to Chromosome Classification., and . IbPRIA, volume 6669 of Lecture Notes in Computer Science, page 256-264. Springer, (2011)Which Fast Nearest Neighbour Search Algorithm to Use?, , and . IbPRIA, volume 7887 of Lecture Notes in Computer Science, page 567-574. Springer, (2013)Language understanding and subsequential transducer learning., , , and . Comput. Speech Lang., 12 (3): 193-228 (1998)Dynamic Insertions in TLAESA Fast NN Search Algorithm., and . ICPR, page 3828-3833. IEEE Computer Society, (2014)A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms., , , , and . IbPRIA (2), volume 4478 of Lecture Notes in Computer Science, page 306-313. Springer, (2007)Computing the Most Probable String with a Probabilistic Finite State Machine., and . FSMNLP, page 1-8. The Association for Computer Linguistics, (2013)The Data Driven Approach Applied to the OSTIA Algorithm.. ICGI, volume 1433 of Lecture Notes in Computer Science, page 50-56. Springer, (1998)Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms., , , , and . SSPR/SPR, volume 6218 of Lecture Notes in Computer Science, page 80-89. Springer, (2010)Comparison of fast nearest neighbour classifiers for handwritten character recognition., and . Pattern Recognit. Lett., 19 (3-4): 351-356 (1998)The most probable string: an algorithmic study., and . J. Log. Comput., 24 (2): 311-330 (2014)