+
+
+
+
|
|
2021
15th workshop gRFIA
9th Music Encoding Conference (MEI 2021)
Alicante, July 19-23
13th international workshop on Machine Learning and Music
(online) September 18, 2020
|
|
Department of Software and Computing Systems.
University of Alicante.
E-03080 Alicante.
Spain
E-mail: eva at dlsi.ua.es
Telephone: +34 96 5903400 ext. 2451 Other pages:
Teaching, Personal Curriculum Vitae:not available yet Research Interests: Projects: Select a year
: all
: 2012
: 2010
: 2008
: 2007
: 2006
: 2005
: 2003
: 2002
: 2000
: 1999
: 1997
: 1995 - Gómez-Ballester, E.
"Aportaciones a la mejora de la eficiencia de la búsqueda del vecino más cercano"
PhD Thesis.
Supervisors: Micó, L.; Oncina, J. Departamento de Lenguajes y Sistemas Informáticos
(2012)
: bibtex
: more info - Gómez-Ballester, E.; Micó, L.; Thollard, F.; Oncina, J.; Moreno-Seco, F.
"Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms " Structural, Syntactic, and Statistical Pattern Recognition, ISBN: 978-3-642-14979-5, pp. 80--89, Cesme, Turkey
(2010)
: bibtex
: pdf
: more info - Gómez-Ballester, E; Micó, L.; Oncina, J.
"A pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms" Lecture Notes in Computer Science, vol. 5342, pp. 936-946
(2008)
: bibtex
: pdf
: more info - Oncina J., Thollard F., Gómez-Ballester E., Micó L., Moreno-Seco F.
"A tabular pruning rule in tree-based pruning rule fast nearest neighbour search algorithms" Lecture Notes in Computer Science, vol. 4478, pp. 306-313
(2007)
: bibtex
: pdf
: more info - Gómez-Ballester E.; Micó L.; Oncina J.
"Some approaches to improve tree-based nearest neighbour search algorithms" Pattern Recognition, vol. 39, pp. 171-179
(2006)
: bibtex
: ps
: more info - Gómez-Ballester, E.; Micó, L.; Oncina, J.
"Testing Some Improvements of the Fukunaga and Narendra´s Fast Nearest Neighbour Search Algorithm in a Spelling Task" Lecture Notes in Computer Science, vol. 3523, pp. 3 - 10
(2005)
: bibtex
: pdf - Gómez-Ballester, E.; Micó, L.; Oncina, J
"Some Improvements in Tree Based Nearest Neighbour Search Algorithms" 0302-9743 - Lecture Notes in Computer Science - Lecture Notes in Artificial Intelligence, pp. 456-463
(2003)
: bibtex
: pdf - Gómez-Ballester, E.;Micó, L.;Oncina, J.
"A fast approximated k-median algorithm" Lecture Notes in Computer Science - Lecture Notes in Artificial Intelligence, vol. 2396, pp. 684-690
(2002)
: bibtex
: ps - Gómez-Ballester, E.; Forcada-Zubizarreta, M.L.; Micó-Andrés, M.L.
"A gradient-descent method to adapt the edit-distance to a classification task" Pattern Recognition and Applications. Frontiers in Artificial Intelli-gence and Applications, pp. 18
(2000)
: bibtex - Gómez-Ballester, Eva; Forcada-Zubizarreta. Mikel L.; Micó, Luisa
"A gradient-descent method to adapt the edit distance to a classification task" Pattern Recognition and Image Analysis, Proceedings of the VIII Simposium Nacional de Reconocimiento de Formas y Análisis de Imágenes, pp. 216
(1999)
: bibtex - Gómez-Ballester, E.; Micó-Andrés, M.L.; Oncina, J.; Forcada-Zubizarreta, M.L.
"An empirical method to improve edit-distance parameters for a nearest-neighbor-based classification task" VII Spanish Symposium on Pattern Recognition and Image Analysis, Barcelona, Spain
(1997)
: bibtex - Gómez-Ballester, E.; Micó-Andrés, M.L.; Oncina, J.
"Testing the linear approximating and eliminating search algorithm in handwritten character recognition tasks" VI Spanish Symposium on Pattern Recognition and Image Analysis, Córdoba, Spain
(1995)
: bibtex
: ps
Accessed 157197 times since:
2004-10-06
|
|
Last updated: 2003-02-16
| |
|