Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Andrew Melbourne

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 Helen O'Reilly

> Home > Persons > Andrew Melbourne

Publications

2024
[j15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/mia/IrzanHOOMM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mia/IrzanHOOMM24
Hassna Irzan, Michael Hütel, Helen O'Reilly, Sébastien Ourselin, Neil Marlow, Andrew Melbourne:
Multi-source multi-modal markers for Bayesian Networks: Application to the extremely preterm born brain. Medical Image Anal. 92: 103037 (2024)
2020
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/miccai/IrzanOOMM20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/miccai/IrzanOOMM20
Hassna Irzan, Helen O'Reilly, Sébastien Ourselin, Neil Marlow, Andrew Melbourne:
Brain Volume and Neuropsychological Differences in Extremely Preterm Adolescents. ASMUS/PIPPI@MICCAI 2020: 315-323
2019
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/isbi/IrzanOOMM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isbi/IrzanOOMM19
Hassna Irzan, Helen O'Reilly, Sébastien Ourselin, Neil Marlow, Andrew Melbourne:
A Framework For Memory Performance Prediction From Brain Volume In Preterm-Born Adolescents. ISBI 2019: 400-403

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.