MARIA LUISA
MICO ANDRES
Researcher in the period 1992-2023
JOSE MARIA
ONCINA CARRATALA
Researcher in the period 1986-2024
Publications by the researcher in collaboration with JOSE MARIA ONCINA CARRATALA (30)
2020
-
Adaptively Learning to Recognize Symbols in Handwritten Early Music
Communications in Computer and Information Science
2016
-
Music staff removal with supervised pixel classification
International Journal on Document Analysis and Recognition, Vol. 19, Núm. 3, pp. 211-219
2014
-
Dynamic Insertions in TLAESA fast NN search algorithm
Proceedings - International Conference on Pattern Recognition
2013
-
Which fast nearest neighbour search algorithm to use?
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2012
-
A log square average case algorithm to make insertions in fast similarity search
Pattern Recognition Letters, Vol. 33, Núm. 9, pp. 1060-1065
-
Restructuring versus non restructuring insertions in MDF indexes
ICPRAM 2012 - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods
2011
-
A fast pivot-based indexing algorithm for metric spaces
Pattern Recognition Letters, Vol. 32, Núm. 11, pp. 1511-1516
-
Efficient search supporting several similarity queries by reordering pivots
Proceedings of the 8th IASTED International Conference on Signal Processing, Pattern Recognition, and Applications, SPPRA 2011
-
Impact of the initialization in tree-based fast similarity search techniques
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2010
-
A constant average time algorithm to allow insertions in the LAESA fast nearest neighbour search index
Proceedings - International Conference on Pattern Recognition
-
Combining elimination rules in tree-based nearest neighbor search algorithms
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2009
-
Experimental analysis of insertion costs in a naïve dynamic MDF-tree
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2008
-
A pruning rule based on a distance sparse table for hierarchical similarity search algorithms
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2007
-
A tabular pruning rule in tree-based fast nearest neighbor search algorithms
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
Diseño docente EEES en el 2.º curso de Informática
Redes de investigación docente: Espacio Europeo de Educación Superior (Marfil), pp. 343-378
2006
-
Some approaches to improve tree-based nearest neighbour search algorithms
Pattern Recognition, Vol. 39, Núm. 2, pp. 171-179
2005
-
Testing some improvements of the Fukunaga and Narendra's fast nearest neighbour search algorithm in a spelling task
Lecture Notes in Computer Science
2004
-
A new classification rule based on nearest neighbour search
Proceedings - International Conference on Pattern Recognition
2003
-
A modification of the LAESA algorithm for approximated k-NN classification
Pattern Recognition Letters, Vol. 24, Núm. 1-3, pp. 47-53
-
Approximate nearest neighbour search with the Fukunaga and Narendra algorithm and its application to chromosome classification
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2905, pp. 322-328