default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuisa Micó
Person information
- affiliation: University of Alicante, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c27]Luisa Micó
, José Oncina, José M. Iñesta:
Adaptively Learning to Recognize Symbols in Handwritten Early Music. PKDD/ECML Workshops (2) 2019: 470-477- 2016
- [j12]Jorge Calvo-Zaragoza, Luisa Micó, José Oncina:
Music staff removal with supervised pixel classification. Int. J. Document Anal. Recognit. 19(3): 211-219 (2016) - 2015
- [j11]Luisa Micó, João M. Sanches, Jaime S. Cardoso:
The vitality of pattern recognition and image analysis. Neurocomputing 150: 124-125 (2015) - 2014
- [c26]Luisa Micó, José Oncina:
Dynamic Insertions in TLAESA Fast NN Search Algorithm. ICPR 2014: 3828-3833 - 2013
- [j10]Raisa Socorro Llanes, María Luisa Micó Andrés:
Uso eficiente de pivotes aplicado a la búsqueda aproximada en algoritmos rápidos sobre espacios métricos. Computación y Sistemas 17(4) (2013) - [c25]Aureo Serrano, Luisa Micó, José Oncina:
Which Fast Nearest Neighbour Search Algorithm to Use? IbPRIA 2013: 567-574 - [e2]João M. Sanches, Luisa Micó, Jaime S. Cardoso:
Pattern Recognition and Image Analysis - 6th Iberian Conference, IbPRIA 2013, Funchal, Madeira, Portugal, June 5-7, 2013. Proceedings. Lecture Notes in Computer Science 7887, Springer 2013, ISBN 978-3-642-38627-5 [contents] - 2012
- [j9]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) - [c24]Aureo Serrano, Luisa Micó, José Oncina:
Restructuring versus Non Restructuring Insertions in MDF Indexes. ICPRAM (1) 2012: 474-480 - 2011
- [j8]Raisa Socorro, Luisa Micó, José Oncina:
A fast pivot-based indexing algorithm for metric spaces. Pattern Recognit. Lett. 32(11): 1511-1516 (2011) - [c23]Aureo Serrano, Luisa Micó, José Oncina:
Impact of the Initialization in Tree-Based Fast Similarity Search Techniques. SIMBAD 2011: 163-176 - 2010
- [c22]Luisa Micó, José Oncina:
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index. ICPR 2010: 3911-3914 - [c21]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
- [c20]Luisa Micó, José Oncina:
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree. IbPRIA 2009: 402-408 - 2008
- [c19]Colin de la Higuera, Luisa Micó:
A contextual normalised edit distance. ICDE Workshops 2008: 354-361 - [c18]Colin de la Higuera, Luisa Micó:
A Contextual Normalised Edit Distance. SISAP 2008: 61-68 - [c17]Raisa Socorro, Luisa Micó:
Use of Structured Pattern Representations for Combining Classifiers. SSPR/SPR 2008: 811-820 - [c16]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
- [c15]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 - [c14]Jose-Norberto Mazón, Luisa Micó, Francisco Moreno-Seco:
New Neighborhood Based Classification Rules for Metric Spaces and Their Use in Ensemble Classification. IbPRIA (1) 2007: 354-361 - 2006
- [j7]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) - [c13]Francisco Moreno-Seco, José Manuel Iñesta Quereda, Pedro J. Ponce de León, Luisa Micó:
Comparison of Classifier Fusion Methods for Classification in Pattern Recognition Tasks. SSPR/SPR 2006: 705-713 - [c12]Luisa Micó, Francisco Moreno-Seco, José Salvador Sánchez, José Martínez Sotoca, Ramón Alberto Mollineda:
On the Use of Different Classification Rules in an Editing Task. SSPR/SPR 2006: 747-754 - 2005
- [c11]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
- [c10]Juan Ramón Rico-Juan, Luisa Micó:
Finding Significant Points for a Handwritten Classification Task. ICIAR (1) 2004: 440-446 - [c9]Francisco Moreno-Seco, Luisa Micó, José Oncina:
A New Classification Rule based on Nearest Neighbour Search. ICPR (4) 2004: 408-411 - 2003
- [j6]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) - [j5]Juan Ramón Rico-Juan, Luisa Micó:
Comparison of AESA and LAESA search algorithms using string and tree-edit-distances. Pattern Recognit. Lett. 24(9-10): 1417-1426 (2003) - [c8]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 - [c7]Eva Gómez-Ballester, Luisa Micó, José Oncina:
Some Improvements in Tree Based Nearest Neighbour Search Algorithms. CIARP 2003: 456-463 - [c6]Francisco Moreno-Seco, Luisa Micó, José Oncina:
Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification. IbPRIA 2003: 589-597 - [c5]Juan Ramón Rico-Juan, Luisa Micó:
Some Results about the Use of Tree/String Edit Distances in a~Nearest Neighbour Classification Task. IbPRIA 2003: 821-828 - 2002
- [c4]Francisco Moreno-Seco, Luisa Micó, José Oncina:
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours. SSPR/SPR 2002: 718-724 - [c3]Eva Gómez-Ballester, Luisa Micó, José Oncina:
A Fast Approximated k-Median Algorithm. SSPR/SPR 2002: 725-733 - [e1]José Manuel Iñesta Quereda, Luisa Micó:
Pattern Recognition in Information Systems, Proceedings of the 2nd International Workshop on Pattern Recognition in Information Systems, PRIS 2002, In conjunction with ICEIS 2002, Ciudad Real, Spain, April 2002. ICEIS Press 2002, ISBN 972-98050-8-3 [contents] - 2001
- [j4]Luisa Micó, José Oncina:
An approximate median search algorithm in non-metric spaces. Pattern Recognit. Lett. 22(10): 1145-1151 (2001) - 2000
- [c2]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
- 1998
- [j3]Luisa Micó, José Oncina:
Comparison of fast nearest neighbour classifiers for handwritten character recognition. Pattern Recognit. Lett. 19(3-4): 351-356 (1998) - 1996
- [j2]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) - 1994
- [j1]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) - 1992
- [c1]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
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-04-24 23:06 CEST 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:
