default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Oncina
2010 – 2019
- 2019
[c43]Luisa Micó
, José Oncina, José M. Iñesta:
Adaptively Learning to Recognize Symbols in Handwritten Early Music. PKDD/ECML Workshops (2) 2019: 470-477- 2017
- [j20]Jorge Calvo-Zaragoza, José Oncina:
Recognition of pen-based music notation with finite-state machines. Expert Syst. Appl. 72: 395-406 (2017) - [j19]Jorge Calvo-Zaragoza, José Oncina, Colin de la Higuera:
Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton. Int. J. Found. Comput. Sci. 28(5): 603-622 (2017) - [j18]Jorge Calvo-Zaragoza, Antonio Pertusa, José Oncina:
Staff-line detection and removal using a convolutional neural network. Mach. Vis. Appl. 28(5-6): 665-674 (2017) - [j17]Jorge Calvo-Zaragoza, José Oncina:
An efficient approach for Interactive Sequential Pattern Recognition. Pattern Recognit. 64: 295-304 (2017) - 2016
- [j16]Jorge Calvo-Zaragoza, Luisa Micó, José Oncina:
Music staff removal with supervised pixel classification. Int. J. Document Anal. Recognit. 19(3): 211-219 (2016) - [c42]Jorge Calvo-Zaragoza, Colin de la Higuera, José Oncina:
Computing the Expected Edit Distance from a String to a PFA. CIAA 2016: 39-50 - 2015
- [c41]Jorge Calvo-Zaragoza, José Oncina:
Clustering of Strokes from Pen-Based Music Notation: An Experimental Study. IbPRIA 2015: 633-640 - 2014
- [j15]Colin de la Higuera, José Oncina:
The most probable string: an algorithmic study. J. Log. Comput. 24(2): 311-330 (2014) - [c40]Jorge Calvo-Zaragoza, José Oncina:
Recognition of Pen-Based Music Notation: The HOMUS Dataset. ICPR 2014: 3038-3043 - [c39]Luisa Micó, José Oncina:
Dynamic Insertions in TLAESA Fast NN Search Algorithm. ICPR 2014: 3828-3833 - 2013
- [c38]Colin de la Higuera, José Oncina:
Computing the Most Probable String with a Probabilistic Finite State Machine. FSMNLP 2013: 1-8 - [c37]Aureo Serrano, Luisa Micó, José Oncina:
Which Fast Nearest Neighbour Search Algorithm to Use? IbPRIA 2013: 567-574 - 2012
- [j14]Luisa Micó, José Oncina:
A log square average case algorithm to make insertions in fast similarity search. Pattern Recognit. Lett. 33(9): 1060-1065 (2012) - [c36]Aureo Serrano, Luisa Micó, José Oncina:
Restructuring versus Non Restructuring Insertions in MDF Indexes. ICPRAM (1) 2012: 474-480 - 2011
- [j13]Raisa Socorro, Luisa Micó, José Oncina:
A fast pivot-based indexing algorithm for metric spaces. Pattern Recognit. Lett. 32(11): 1511-1516 (2011) - [c35]José Oncina, Enrique Vidal:
Interactive Structured Output Prediction: Application to Chromosome Classification. IbPRIA 2011: 256-264 - [c34]Colin de la Higuera, José Oncina:
Finding the Most Probable String and the Consensus String: an Algorithmic Study. IWPT 2011: 26-36 - [c33]Aureo Serrano, Luisa Micó, José Oncina:
Impact of the Initialization in Tree-Based Fast Similarity Search Techniques. SIMBAD 2011: 163-176 - 2010
- [c32]Luisa Micó, José Oncina:
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index. ICPR 2010: 3911-3914 - [c31]Eva Gómez-Ballester, Luisa Micó, Franck Thollard, José Oncina, Francisco Moreno-Seco:
Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms. SSPR/SPR 2010: 80-89
2000 – 2009
- 2009
- [j12]José Oncina:
Optimum algorithm to minimize human interactions in sequential Computer Assisted Pattern Recognition. Pattern Recognit. Lett. 30(5): 558-563 (2009) - [c30]Luisa Micó, José Oncina:
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree. IbPRIA 2009: 402-408 - 2008
- [c29]José Oncina:
Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries. ICGI 2008: 154-162 - [c28]Laurent Boyer, Yann Esposito, Amaury Habrard, José Oncina, Marc Sebban:
SEDiL: Software for Edit Distance Learning. ECML/PKDD (2) 2008: 672-677 - [c27]Cristian Olivares-Rodríguez, José Oncina:
A Stochastic Approach to Median String Computation. SSPR/SPR 2008: 431-440 - [c26]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
- [c25]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
- [j11]Eva Gómez-Ballester, Luisa Micó, José Oncina:
Some approaches to improve tree-based nearest neighbour search algorithms. Pattern Recognit. 39(2): 171-179 (2006) - [j10]José Oncina, Marc Sebban:
Learning stochastic edit distance: Application in handwritten character recognition. Pattern Recognit. 39(9): 1575-1587 (2006) - [c24]Amaury Habrard, José Oncina:
Learning Multiplicity Tree Automata. ICGI 2006: 268-280 - [c23]José Oncina, Marc Sebban:
Using Learned Conditional Distributions as Edit Distance. SSPR/SPR 2006: 403-411 - 2005
- [c22]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
- [c21]Colin de la Higuera, José Oncina:
Learning Stochastic Finite Automata. ICGI 2004: 175-186 - [c20]Jorge Calera-Rubio, José Oncina:
Identifying Left-Right Deterministic Linear Languages. ICGI 2004: 283-284 - [c19]Francisco Moreno-Seco, Luisa Micó, José Oncina:
A New Classification Rule based on Nearest Neighbour Search. ICPR (4) 2004: 408-411 - 2003
- [j9]Francisco Moreno-Seco, Luisa Micó, José Oncina:
A modification of the LAESA algorithm for approximated k-NN classification. Pattern Recognit. Lett. 24(1-3): 47-53 (2003) - [c18]Colin de la Higuera, José Oncina:
Identification with Probability One of Stochastic Deterministic Linear Languages. ALT 2003: 247-258 - [c17]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 - [c16]Eva Gómez-Ballester, Luisa Micó, José Oncina:
Some Improvements in Tree Based Nearest Neighbour Search Algorithms. CIARP 2003: 456-463 - [c15]Francisco Moreno-Seco, Luisa Micó, José Oncina:
Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification. IbPRIA 2003: 589-597 - [e2]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, ISBN 953-6690-39-X [contents] - 2002
- [c14]Colin de la Higuera, José Oncina:
Inferring Deterministic Linear Languages. COLT 2002: 185-200 - [c13]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 - [c12]Francisco Moreno-Seco, Luisa Micó, José Oncina:
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours. SSPR/SPR 2002: 718-724 - [c11]Eva Gómez-Ballester, Luisa Micó, José Oncina:
A Fast Approximated k-Median Algorithm. SSPR/SPR 2002: 725-733 - 2001
- [j8]Rafael C. Carrasco, José Oncina, Jorge Calera-Rubio:
Stochastic Inference of Regular Tree Languages. Mach. Learn. 44(1/2): 185-197 (2001) - [j7]Luisa Micó, José Oncina:
An approximate median search algorithm in non-metric spaces. Pattern Recognit. Lett. 22(10): 1145-1151 (2001) - 2000
- [c10]Francisco Moreno-Seco, Luisa Micó, José Oncina:
A Fast Approximately k -Nearest-Neighbour Search Algorithm for Classification Tasks. SSPR/SPR 2000: 823-831
1990 – 1999
- 1999
- [j6]Rafael C. Carrasco, José Oncina:
Learning deterministic regular grammars from stochastic samples in polynomial time. RAIRO Theor. Informatics Appl. 33(1): 1-20 (1999) - 1998
- [j5]Antonio Castellanos, Enrique Vidal, Miguel Angel Varó, José Oncina:
Language understanding and subsequential transducer learning. Comput. Speech Lang. 12(3): 193-228 (1998) - [j4]Luisa Micó, José Oncina:
Comparison of fast nearest neighbour classifiers for handwritten character recognition. Pattern Recognit. Lett. 19(3-4): 351-356 (1998) - [c9]José Oncina:
The Data Driven Approach Applied to the OSTIA Algorithm. ICGI 1998: 50-56 - [c8]Rafael C. Carrasco, José Oncina, Jorge Calera-Rubio:
Stochastic Inference of Regular Tree Languages. ICGI 1998: 187-198 - 1996
- [j3]Luisa Micó, José Oncina, Rafael C. Carrasco:
A fast branch & bound nearest neighbour classifier in metric spaces. Pattern Recognit. Lett. 17(7): 731-739 (1996) - [c7]José Oncina, Miguel Angel Varó:
Using domain information during the learning of a subsequential transducer. ICGI 1996: 301-312 - [c6]Colin de la Higuera, José Oncina, Enrique Vidal:
Identification of DFA: data-dependent vs data-independent algorithms. ICGI 1996: 313-325 - [c5]José Oncina:
The Cocke-Younger-Kasami algorithm for cyclic strings. ICPR 1996: 413-416 - 1994
- [j2]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 Recognit. Lett. 15(1): 9-17 (1994) - [c4]Rafael C. Carrasco, José Oncina:
Learning Stochastic Regular Grammars by Means of a State Merging Method. ICGI 1994: 139-152 - [e1]Rafael C. Carrasco, José Oncina:
Grammatical Inference and Applications, Second International Colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994, Proceedings. Lecture Notes in Computer Science 862, Springer 1994, ISBN 3-540-58473-0 [contents] - 1993
- [j1]José Oncina, Pedro García, Enrique Vidal:
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks. IEEE Trans. Pattern Anal. Mach. Intell. 15(5): 448-458 (1993) - 1992
- [c3]José Oncina, Pedro García, Enrique Vidal:
Transducer learning in pattern recognition. ICPR (2) 1992: 299-302 - [c2]Luisa Micó, José Oncina, Enrique Vidal:
An algorithm for finding nearest neighbours in constant average time with a linear space complexity. ICPR (2) 1992: 557-560 - 1990
- [c1]Pedro García, Enrique Vidal, José Oncina:
Learning Locally Testable Languages in the Strict Sense. ALT 1990: 325-338
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
