Fernando E. B. Otero

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with David Camacho

> Home > Persons > Fernando E. B. Otero

Publications

2017
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/ijbic/MenendezOC17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijbic/MenendezOC17
Héctor D. Menéndez, Fernando E. B. Otero, David Camacho:
Extending the SACOC algorithm through the Nyström method for dense manifold data analysis. Int. J. Bio Inspired Comput. 10(2): 127-135 (2017)
2016
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/swarm/MenendezOC16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/swarm/MenendezOC16
Héctor D. Menéndez, Fernando E. B. Otero, David Camacho:
Medoid-based clustering using ant colony optimization. Swarm Intell. 10(2): 123-145 (2016)
2014
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/antsw/MenendezOC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/antsw/MenendezOC14
Héctor D. Menéndez, Fernando E. B. Otero, David Camacho:
MACOC: A Medoid-Based ACO Clustering Algorithm. ANTS Conference 2014: 122-133
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/idc/MenendezOC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/idc/MenendezOC14
Héctor D. Menéndez, Fernando E. B. Otero, David Camacho:
SACOC: A Spectral-Based ACO Clustering Algorithm. IDC 2014: 185-194

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.