Luisa Micó

Orcid: 0000-0002-2223-353X

Affiliations:
  • University of Alicante, Spain


According to our database1, Luisa Micó authored at least 38 papers between 1992 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Adaptively Learning to Recognize Symbols in Handwritten Early Music.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2016
Music staff removal with supervised pixel classification.
Int. J. Document Anal. Recognit., 2016

2015
The vitality of pattern recognition and image analysis.
Neurocomputing, 2015

2014
Dynamic Insertions in TLAESA Fast NN Search Algorithm.
Proceedings of the 22nd International Conference on Pattern Recognition, 2014

2013
Uso eficiente de pivotes aplicado a la búsqueda aproximada en algoritmos rápidos sobre espacios métricos.
Computación y Sistemas, 2013

Which Fast Nearest Neighbour Search Algorithm to Use?
Proceedings of the Pattern Recognition and Image Analysis - 6th Iberian Conference, 2013

2012
A log square average case algorithm to make insertions in fast similarity search.
Pattern Recognit. Lett., 2012

Restructuring versus Non Restructuring Insertions in MDF Indexes.
Proceedings of the ICPRAM 2012, 2012

2011
A fast pivot-based indexing algorithm for metric spaces.
Pattern Recognit. Lett., 2011

Impact of the Initialization in Tree-Based Fast Similarity Search Techniques.
Proceedings of the Similarity-Based Pattern Recognition - First International Workshop, 2011

2010
Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms.
Proceedings of the Structural, 2010

A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index.
Proceedings of the 20th International Conference on Pattern Recognition, 2010

2009
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree.
Proceedings of the Pattern Recognition and Image Analysis, 4th Iberian Conference, 2009

2008
Use of Structured Pattern Representations for Combining Classifiers.
Proceedings of the Structural, 2008

A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms.
Proceedings of the Structural, 2008

A contextual normalised edit distance.
Proceedings of the 24th International Conference on Data Engineering Workshops, 2008

2007
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms.
Proceedings of the Pattern Recognition and Image Analysis, Third Iberian Conference, 2007

New Neighborhood Based Classification Rules for Metric Spaces and Their Use in Ensemble Classification.
Proceedings of the Pattern Recognition and Image Analysis, Third Iberian Conference, 2007

2006
Some approaches to improve tree-based nearest neighbour search algorithms.
Pattern Recognit., 2006

Comparison of Classifier Fusion Methods for Classification in Pattern Recognition Tasks.
Proceedings of the Structural, 2006

On the Use of Different Classification Rules in an Editing Task.
Proceedings of the Structural, 2006

2005
Testing Some Improvements of the Fukunaga and Narendra's Fast Nearest Neighbour Search Algorithm in a Spelling Task.
Proceedings of the Pattern Recognition and Image Analysis, Second Iberian Conference, 2005

2004
A New Classification Rule based on Nearest Neighbour Search.
Proceedings of the 17th International Conference on Pattern Recognition, 2004

Finding Significant Points for a Handwritten Classification Task.
Proceedings of the Image Analysis and Recognition: International Conference, 2004

2003
Comparison of AESA and LAESA search algorithms using string and tree-edit-distances.
Pattern Recognit. Lett., 2003

A modification of the LAESA algorithm for approximated k-NN classification.
Pattern Recognit. Lett., 2003

Some Results about the Use of Tree/String Edit Distances in a~Nearest Neighbour Classification Task.
Proceedings of the Pattern Recognition and Image Analysis, First Iberian Conference, 2003

Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification.
Proceedings of the Pattern Recognition and Image Analysis, First Iberian Conference, 2003

Approximate Nearest Neighbour Search with the Fukunaga and Narendra Algorithm and Its Application to Chromosome Classification.
Proceedings of the Progress in Pattern Recognition, 2003

Some Improvements in Tree Based Nearest Neighbour Search Algorithms.
Proceedings of the Progress in Pattern Recognition, 2003

2002
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours.
Proceedings of the Structural, 2002

A Fast Approximated k-Median Algorithm.
Proceedings of the Structural, 2002

2001
An approximate median search algorithm in non-metric spaces.
Pattern Recognit. Lett., 2001

2000
A Fast Approximately k -Nearest-Neighbour Search Algorithm for Classification Tasks.
Proceedings of the Advances in Pattern Recognition, Joint IAPR International Workshops SSPR 2000 and SPR 2000, [8th International Workshop on Structural and Syntactic Pattern Recognition, 3rd International Workshop on Statistical Techniques in Pattern Recognition], Alicante, Spain, August 30, 2000

1998
Comparison of fast nearest neighbour classifiers for handwritten character recognition.
Pattern Recognit. Lett., 1998

1996
A fast branch & bound nearest neighbour classifier in metric spaces.
Pattern Recognit. Lett., 1996

1994
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements.
Pattern Recognit. Lett., 1994

1992
An algorithm for finding nearest neighbours in constant average time with a linear space complexity.
Proceedings of the 11th IAPR International Conference on Pattern Recognition, 1992


  Loading...