 | 2009 |
|---|
| 41 |       | Luisa Micó,
José Oncina:
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree.
IbPRIA 2009: 402-408 |
| 40 | | José Oncina:
Optimum algorithm to minimize human interactions in sequential Computer Assisted Pattern Recognition.
Pattern Recognition Letters 30(5): 558-563 (2009) |
| 2008 |
|---|
| 39 | | Laurent Boyer,
Yann Esposito,
Amaury Habrard,
José Oncina,
Marc Sebban:
SEDiL: Software for Edit Distance Learning.
ECML/PKDD (2) 2008: 672-677 |
| 38 | | José Oncina:
Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries.
ICGI 2008: 154-162 |
| 37 | | Cristian Olivares-Rodríguez,
José Oncina:
A Stochastic Approach to Median String Computation.
SSPR/SPR 2008: 431-440 |
| 36 | | Eva Gómez-Ballester,
Luisa Micó,
José Oncina:
A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms.
SSPR/SPR 2008: 926-936 |
| 2007 |
|---|
| 35 | | 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.
IbPRIA (2) 2007: 306-313 |
| 2006 |
|---|
| 34 | | Amaury Habrard,
José Oncina:
Learning Multiplicity Tree Automata.
ICGI 2006: 268-280 |
| 33 | | José Oncina,
Marc Sebban:
Using Learned Conditional Distributions as Edit Distance.
SSPR/SPR 2006: 403-411 |
| 32 | | Eva Gómez-Ballester,
Luisa Micó,
José Oncina:
Some approaches to improve tree-based nearest neighbour search algorithms.
Pattern Recognition 39(2): 171-179 (2006) |
| 31 | | José Oncina,
Marc Sebban:
Learning stochastic edit distance: Application in handwritten character recognition.
Pattern Recognition 39(9): 1575-1587 (2006) |
| 2005 |
|---|
| 30 | | 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.
IbPRIA (2) 2005: 3-10 |
| 2004 |
|---|
| 29 | | Colin de la Higuera,
José Oncina:
Learning Stochastic Finite Automata.
ICGI 2004: 175-186 |
| 28 | | Jorge Calera-Rubio,
José Oncina:
Identifying Left-Right Deterministic Linear Languages.
ICGI 2004: 283-284 |
| 27 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
A New Classification Rule based on Nearest Neighbour Search.
ICPR (4) 2004: 408-411 |
| 2003 |
|---|
| 26 |  | Colin de la Higuera,
Pieter W. Adriaans,
Menno van Zaanen,
José Oncina:
Proceedings of the Workshop and Tutorial on Learning Contex-Free Grammars, ECML 2003, Cavtat-Dubrovnik, Croatia, September 22-26, 2003
Ruder Boskovic Institute, Zagreb, Croatia 2003 |
| 25 | | Colin de la Higuera,
José Oncina:
Identification with Probability One of Stochastic Deterministic Linear Languages.
ALT 2003: 247-258 |
| 24 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
Approximate Nearest Neighbour Search with the Fukunaga and Narendra Algorithm and Its Application to Chromosome Classification.
CIARP 2003: 322-328 |
| 23 | | Eva Gómez-Ballester,
Luisa Micó,
José Oncina:
Some Improvements in Tree Based Nearest Neighbour Search Algorithms.
CIARP 2003: 456-463 |
| 22 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification.
IbPRIA 2003: 589-597 |
| 21 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
A modification of the LAESA algorithm for approximated k-NN classification.
Pattern Recognition Letters 24(1-3): 47-53 (2003) |
| 2002 |
|---|
| 20 | | Colin de la Higuera,
José Oncina:
Inferring Deterministic Linear Languages.
COLT 2002: 185-200 |
| 19 | | Colin de la Higuera,
José Oncina:
On Sufficient Conditions to Identify in the Limit Classes of Grammars from Polynomial Time and Data.
ICGI 2002: 134-148 |
| 18 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours.
SSPR/SPR 2002: 718-724 |
| 17 | | Eva Gómez-Ballester,
Luisa Micó,
José Oncina:
A Fast Approximated k-Median Algorithm.
SSPR/SPR 2002: 725-733 |
| 2001 |
|---|
| 16 | | Rafael C. Carrasco,
José Oncina,
Jorge Calera-Rubio:
Stochastic Inference of Regular Tree Languages.
Machine Learning 44(1/2): 185-197 (2001) |
| 15 | | Luisa Micó,
José Oncina:
An approximate median search algorithm in non-metric spaces.
Pattern Recognition Letters 22(10): 1145-1151 (2001) |
| 2000 |
|---|
| 14 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
A Fast Approximately k -Nearest-Neighbour Search Algorithm for Classification Tasks.
SSPR/SPR 2000: 823-831 |
| 1999 |
|---|
| 13 | | Rafael C. Carrasco,
José Oncina:
Learning deterministic regular grammars from stochastic samples in polynomial time.
ITA 33(1): 1-20 (1999) |
| 1998 |
|---|
| 12 | | Rafael C. Carrasco,
José Oncina,
Jorge Calera-Rubio:
Stochastic Inference of Regular Tree Languages.
ICGI 1998: 187-198 |
| 11 | | José Oncina:
The Data Driven Approach Applied to the OSTIA Algorithm.
ICGI 1998: 50-56 |
| 10 | | Antonio Castellanos,
Enrique Vidal,
Miguel Angel Varó,
José Oncina:
Language understanding and subsequential transducer learning.
Computer Speech & Language 12(3): 193-228 (1998) |
| 9 | | Luisa Micó,
José Oncina:
Comparison of fast nearest neighbour classifiers for handwritten character recognition.
Pattern Recognition Letters 19(3-4): 351-356 (1998) |
| 1996 |
|---|
| 8 | | José Oncina,
Miguel Angel Varó:
Using domain information during the learning of a subsequential transducer.
ICGI 1996: 301-312 |
| 7 | | Colin de la Higuera,
José Oncina,
Enrique Vidal:
Identification of DFA: data-dependent vs data-independent algorithms.
ICGI 1996: 313-325 |
| 6 | | Luisa Micó,
José Oncina,
Rafael C. Carrasco:
A fast branch & bound nearest neighbour classifier in metric spaces.
Pattern Recognition Letters 17(7): 731-739 (1996) |
| 1994 |
|---|
| 5 | | Rafael C. Carrasco,
José Oncina:
Grammatical Inference and Applications, Second International Colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994, Proceedings
Springer 1994 |
| 4 | | Rafael C. Carrasco,
José Oncina:
Learning Stochastic Regular Grammars by Means of a State Merging Method.
ICGI 1994: 139-152 |
| 3 | | 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.
Pattern Recognition Letters 15(1): 9-17 (1994) |
| 1993 |
|---|
| 2 | | José Oncina,
Pedro Garcia,
Enrique Vidal:
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks.
IEEE Trans. Pattern Anal. Mach. Intell. 15(5): 448-458 (1993) |
| 1990 |
|---|
| 1 | | Pedro Garcia,
Enrique Vidal,
José Oncina:
Learning Locally Testable Languages in the Strict Sense.
ALT 1990: 325-338 |
