Frédéric Alexandre

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 Randa Kassab

> Home > Persons > Frédéric Alexandre

Publications

2015
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/ijcci/KassabA15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcci/KassabA15
Randa Kassab, Frédéric Alexandre:
A Heteroassociative Learning Model Robust to Interference. IJCCI (NCTA) 2015: 49-57
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/ijcci/KassabA15a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcci/KassabA15a
Randa Kassab, Frédéric Alexandre:
A Modular Network Architecture Resolving Memory Interference Through Inhibition. IJCCI (Selected Papers) 2015: 407-422
2014
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/ijcci/AlexandreCK14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcci/AlexandreCK14
Frédéric Alexandre, Maxime Carrere, Randa Kassab:
Feature, Configuration, History - A Bio-inspired Framework for Information Representation in Neural Networks. IJCCI (NCTA) 2014: 316-321
2009
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/ml/KassabA09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ml/KassabA09
Randa Kassab, Frédéric Alexandre:
Incremental data-driven learning of a novelty detection model for one-class classification with application to high-dimensional noisy data. Mach. Learn. 74(2): 191-234 (2009)

a service of

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.