Publicacións (19) Publicacións de FRANCISCO MORENO SECO

2022

  1. Desarrollo de tutores virtuales para el apoyo a la docencia

    Memorias del Programa de Redes de investigación en docencia universitaria: Convocatoria 2021-22 (Instituto de Ciencias de la Educación), pp. 301-318

2015

  1. Red de seguimiento de calidad de asignaturas de primer curso del Grado en Ingeniería Informática

    Investigación y Propuestas Innovadoras de Redes UA para la Mejora Docente (Instituto de Ciencias de la Educación), pp. 550-565

2013

  1. Red de coordinación e implementación eficaz del Cuarto Curso de la titulación de Grado en Ingeniería Informática

    La producción científica y la actividad de innovación docente en proyectos de redes (Instituto de Ciencias de la Educación), pp. 477-493

2010

  1. 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)

  2. Red de desarrollo y diseño curricular en la titulación de Grado en Informática

    Comunidad investigadora del Programa Redes: proyectos y resultados (Instituto de Ciencias de la Educación), pp. 808-826

2007

  1. 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)

  2. Implementación de metodologías docentes para la asignatura "Fundamentos de Programación II" conforme con el sistema ECTS: (Curso 2005-2006)

    Implementación de las metodologías ECTS en primer curso de las titulaciones de informática (Instituto de Ciencias de la Educación)

  3. New neighborhood based classification rules for metric spaces and their use in ensemble classification

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2006

  1. Comparison of classifier fusion methods for classification in pattern recognition tasks

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. On the use of different classification rules in an editing task

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2004

  1. A new classification rule based on nearest neighbour search

    Proceedings - International Conference on Pattern Recognition

2003

  1. A modification of the LAESA algorithm for approximated k-NN classification

    Pattern Recognition Letters, Vol. 24, Núm. 1-3, pp. 47-53

  2. 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

  3. Extending fast nearest neighbour search algorithms for approximate k-NN classification

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2652, pp. 589-597

  4. Tree-structured representation of musical information

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2652, pp. 838-846

2002

  1. Diseño de compiladores

    Servicio de Publicaciones

  2. Extending LAESA fast nearest neighbour algorithm to find the k nearest neighbours

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2396, pp. 718-724

2000

  1. A fast approximately k-nearest-neighbour search algorithm for classification tasks

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

1996

  1. Learning compiler design as a research activity

    International Journal of Phytoremediation, Vol. 21, Núm. 1, pp. 73-98