The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

José Oncina: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pedro Garcia, Enrique Vidal, José Oncina
    Learning Locally Testable Languages in the Strict Sense. [Citation Graph (0, 0)][DBLP]
    ALT, 1990, pp:325-338 [Conf]
  2. Colin de la Higuera, José Oncina
    Identification with Probability One of Stochastic Deterministic Linear Languages. [Citation Graph (0, 0)][DBLP]
    ALT, 2003, pp:247-258 [Conf]
  3. Eva Gómez-Ballester, Luisa Micó, José Oncina
    Some Improvements in Tree Based Nearest Neighbour Search Algorithms. [Citation Graph (0, 0)][DBLP]
    CIARP, 2003, pp:456-463 [Conf]
  4. Francisco Moreno-Seco, Luisa Micó, José Oncina
    Approximate Nearest Neighbour Search with the Fukunaga and Narendra Algorithm and Its Application to Chromosome Classification. [Citation Graph (0, 0)][DBLP]
    CIARP, 2003, pp:322-328 [Conf]
  5. Colin de la Higuera, José Oncina
    Inferring Deterministic Linear Languages. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:185-200 [Conf]
  6. Eva Gómez-Ballester, Luisa Micó, José Oncina
    Testing Some Improvements of the Fukunaga and Narendra's Fast Nearest Neighbour Search Algorithm in a Spelling Task. [Citation Graph (0, 0)][DBLP]
    IbPRIA (2), 2005, pp:3-10 [Conf]
  7. Francisco Moreno-Seco, Luisa Micó, José Oncina
    Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification. [Citation Graph (0, 0)][DBLP]
    IbPRIA, 2003, pp:589-597 [Conf]
  8. José Oncina
    The Data Driven Approach Applied to the OSTIA Algorithm. [Citation Graph (0, 0)][DBLP]
    ICGI, 1998, pp:50-56 [Conf]
  9. José Oncina, Miguel Angel Varó
    Using domain information during the learning of a subsequential transducer. [Citation Graph (0, 0)][DBLP]
    ICGI, 1996, pp:301-312 [Conf]
  10. Amaury Habrard, José Oncina
    Learning Multiplicity Tree Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2006, pp:268-280 [Conf]
  11. Colin de la Higuera, José Oncina
    On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 2002, pp:134-148 [Conf]
  12. Jorge Calera-Rubio, José Oncina
    Identifying Left-Right Deterministic Linear Languages. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:283-284 [Conf]
  13. Colin de la Higuera, José Oncina
    Learning Stochastic Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2004, pp:175-186 [Conf]
  14. Colin de la Higuera, José Oncina, Enrique Vidal
    Identification of DFA: data-dependent vs data-independent algorithms. [Citation Graph (0, 0)][DBLP]
    ICGI, 1996, pp:313-325 [Conf]
  15. Rafael C. Carrasco, José Oncina
    Learning Stochastic Regular Grammars by Means of a State Merging Method. [Citation Graph (0, 0)][DBLP]
    ICGI, 1994, pp:139-152 [Conf]
  16. Rafael C. Carrasco, José Oncina, Jorge Calera-Rubio
    Stochastic Inference of Regular Tree Languages. [Citation Graph (0, 0)][DBLP]
    ICGI, 1998, pp:187-198 [Conf]
  17. Francisco Moreno-Seco, Luisa Micó, José Oncina
    A New Classification Rule based on Nearest Neighbour Search. [Citation Graph (0, 0)][DBLP]
    ICPR (4), 2004, pp:408-411 [Conf]
  18. Eva Gómez-Ballester, Luisa Micó, José Oncina
    A Fast Approximated k-Median Algorithm. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2002, pp:725-733 [Conf]
  19. Francisco Moreno-Seco, Luisa Micó, José Oncina
    A Fast Approximately k -Nearest-Neighbour Search Algorithm for Classification Tasks. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2000, pp:823-831 [Conf]
  20. Francisco Moreno-Seco, Luisa Micó, José Oncina
    Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2002, pp:718-724 [Conf]
  21. José Oncina, Marc Sebban
    Using Learned Conditional Distributions as Edit Distance. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2006, pp:403-411 [Conf]
  22. Rafael C. Carrasco, José Oncina
    Learning deterministic regular grammars from stochastic samples in polynomial time. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:1, pp:1-20 [Journal]
  23. Rafael C. Carrasco, José Oncina, Jorge Calera-Rubio
    Stochastic Inference of Regular Tree Languages. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:44, n:1/2, pp:185-197 [Journal]
  24. José Oncina, Pedro Garcia, Enrique Vidal
    Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1993, v:15, n:5, pp:448-458 [Journal]
  25. Eva Gómez-Ballester, Luisa Micó, José Oncina
    Some approaches to improve tree-based nearest neighbour search algorithms. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2006, v:39, n:2, pp:171-179 [Journal]
  26. José Oncina, Marc Sebban
    Learning stochastic edit distance: Application in handwritten character recognition. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2006, v:39, n:9, pp:1575-1587 [Journal]
  27. Luisa Micó, José Oncina
    Comparison of fast nearest neighbour classifiers for handwritten character recognition. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1998, v:19, n:3-4, pp:351-356 [Journal]
  28. Luisa Micó, José Oncina
    An approximate median search algorithm in non-metric spaces. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 2001, v:22, n:10, pp:1145-1151 [Journal]
  29. Luisa Micó, José Oncina, Rafael C. Carrasco
    A fast branch & bound nearest neighbour classifier in metric spaces. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1996, v:17, n:7, pp:731-739 [Journal]
  30. Luisa Micó, José Oncina, Enrique Vidal
    A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1994, v:15, n:1, pp:9-17 [Journal]
  31. Francisco Moreno-Seco, Luisa Micó, José Oncina
    A modification of the LAESA algorithm for approximated k-NN classification. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 2003, v:24, n:1-3, pp:47-53 [Journal]
  32. José Oncina, Franck Thollard, Eva Gómez-Ballester, Luisa Micó, Francisco Moreno-Seco
    A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms. [Citation Graph (0, 0)][DBLP]
    IbPRIA (2), 2007, pp:306-313 [Conf]

  33. Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree. [Citation Graph (, )][DBLP]


  34. Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries. [Citation Graph (, )][DBLP]


  35. SEDiL: Software for Edit Distance Learning. [Citation Graph (, )][DBLP]


  36. A Stochastic Approach to Median String Computation. [Citation Graph (, )][DBLP]


  37. A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms. [Citation Graph (, )][DBLP]


  38. Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002