Fabrizio Esposito

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 Paola Galdi

> Home > Persons > Fabrizio Esposito

Publications

2019
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/ijns/SerraGPFTTTE19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijns/SerraGPFTTTE19
Angela Serra, Paola Galdi, Emanuele Pesce, Michele Fratello, Francesca Trojsi, Gioacchino Tedeschi, Roberto Tagliaferri, Fabrizio Esposito:
Strong-Weak Pruning for Brain Network Identification in Connectome-Wide Neuroimaging: Application to Amyotrophic Lateral Sclerosis Disease Stage Characterization. Int. J. Neural Syst. 29(7): 1950007:1-1950007:20 (2019)
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/ni/GaldiFTRTTE19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ni/GaldiFTRTTE19
Paola Galdi, Michele Fratello, Francesca Trojsi, Antonio Russo, Gioacchino Tedeschi, Roberto Tagliaferri, Fabrizio Esposito:
Stochastic Rank Aggregation for the Identification of Functional Neuromarkers. Neuroinformatics 17(4): 479-496 (2019)
2018
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/soco/GaldiFTRTTE18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/GaldiFTRTTE18
Paola Galdi, Michele Fratello, Francesca Trojsi, Antonio Russo, Gioacchino Tedeschi, Roberto Tagliaferri, Fabrizio Esposito:
Consensus-based feature extraction in rs-fMRI data analysis. Soft Comput. 22(11): 3785-3795 (2018)

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.