 | 2012 |
|---|
| 33 |       | Aureo Serrano,
Luisa Micó,
José Oncina:
Restructuring versus Non Restructuring Insertions in MDF Indexes.
ICPRAM (1) 2012: 474-480 |
| 32 |  | Luisa Micó,
José Oncina:
A log square average case algorithm to make insertions in fast similarity search.
Pattern Recognition Letters 33(9): 1060-1065 (2012) |
| 2011 |
|---|
| 31 | | Aureo Serrano,
Luisa Micó,
José Oncina:
Impact of the Initialization in Tree-Based Fast Similarity Search Techniques.
SIMBAD 2011: 163-176 |
| 30 | | Raisa Socorro,
Luisa Micó,
José Oncina:
A fast pivot-based indexing algorithm for metric spaces.
Pattern Recognition Letters 32(11): 1511-1516 (2011) |
| 2010 |
|---|
| 29 | | Luisa Micó,
José Oncina:
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index.
ICPR 2010: 3911-3914 |
| 28 | | 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 |
| 2009 |
|---|
| 27 | | Luisa Micó,
José Oncina:
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree.
IbPRIA 2009: 402-408 |
| 2008 |
|---|
| 26 | | Colin de la Higuera,
Luisa Micó:
A contextual normalised edit distance.
ICDE Workshops 2008: 354-361 |
| 25 | | Colin de la Higuera,
Luisa Micó:
A Contextual Normalised Edit Distance.
SISAP 2008: 61-68 |
| 24 | | Raisa Socorro,
Luisa Micó:
Use of Structured Pattern Representations for Combining Classifiers.
SSPR/SPR 2008: 811-820 |
| 23 | | 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 |
|---|
| 22 | | 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 |
| 21 | | 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 |
|---|
| 20 | | 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 |
| 19 | | 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 |
| 18 | | 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) |
| 2005 |
|---|
| 17 | | 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 |
|---|
| 16 | | Juan Ramón Rico-Juan,
Luisa Micó:
Finding Significant Points for a Handwritten Classification Task.
ICIAR (1) 2004: 440-446 |
| 15 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
A New Classification Rule based on Nearest Neighbour Search.
ICPR (4) 2004: 408-411 |
| 2003 |
|---|
| 14 | | 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 |
| 13 | | Eva Gómez-Ballester,
Luisa Micó,
José Oncina:
Some Improvements in Tree Based Nearest Neighbour Search Algorithms.
CIARP 2003: 456-463 |
| 12 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification.
IbPRIA 2003: 589-597 |
| 11 | | 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 |
| 10 | | 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) |
| 9 | | Juan Ramón Rico-Juan,
Luisa Micó:
Comparison of AESA and LAESA search algorithms using string and tree-edit-distances.
Pattern Recognition Letters 24(9-10): 1417-1426 (2003) |
| 2002 |
|---|
| 8 | | 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 |
| 7 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours.
SSPR/SPR 2002: 718-724 |
| 6 | | Eva Gómez-Ballester,
Luisa Micó,
José Oncina:
A Fast Approximated k-Median Algorithm.
SSPR/SPR 2002: 725-733 |
| 2001 |
|---|
| 5 | | Luisa Micó,
José Oncina:
An approximate median search algorithm in non-metric spaces.
Pattern Recognition Letters 22(10): 1145-1151 (2001) |
| 2000 |
|---|
| 4 | | Francisco Moreno-Seco,
Luisa Micó,
José Oncina:
A Fast Approximately k -Nearest-Neighbour Search Algorithm for Classification Tasks.
SSPR/SPR 2000: 823-831 |
| 1998 |
|---|
| 3 | | Luisa Micó,
José Oncina:
Comparison of fast nearest neighbour classifiers for handwritten character recognition.
Pattern Recognition Letters 19(3-4): 351-356 (1998) |
| 1996 |
|---|
| 2 | | 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 |
|---|
| 1 | | 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) |
Data released under the ODC-BY 1.0 license — See also our legal information page