Skip to content
Back home
  • Home
  • Research
    • Graph Analytics
      • Accelerating Subgraph Isomorphism Search Using Graphlets
      • ParaGrapher
      • MS-BioGraphs
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise and Approximate Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
      • FERNS
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
    • FERNS
  • Publications
    • Articles
    • Dissertations
    • Source Code
    • Datasets
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact
  • Search
Back home
  • Search
  • Home
  • Research
    • Graph Analytics
      • Accelerating Subgraph Isomorphism Search Using Graphlets
      • ParaGrapher
      • MS-BioGraphs
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise and Approximate Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
      • FERNS
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
    • FERNS
  • Publications
    • Articles
    • Dissertations
    • Source Code
    • Datasets
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact
Home » Uncategorised » Brian Dandurand is offered a Marie Curie Individual Fellowship
Uncategorised

Brian Dandurand is offered a Marie Curie Individual Fellowship

by Hans Vandierendonck|Published 17 February 2024

Congratulations to Brian Dandurand who has received notification that his Individual Fellowship proposal entitled “Scaling Parallelism and Convexity Hurdles in Bi-Level Machine Learning” has been proposed for funding.

More details will follow in due time.

  • high performance computing
  • machine learning
  • pacobi

You may also like

Invited Talk: Metaprogramming in Jupyter Notebooks – Dr Jeremy Singer
Published 5 February 2021

Invited Talk: Metaprogramming in Jupyter Notebooks – Dr Jeremy Singer

Dr Jeremy Singer, University of Glasgow25 February 2021 Abstract:Love ’em or hate ’em, interactive computational notebooks are here to stay as a […]

Published 15 May 2024

QClique: Optimizing Performance and Accuracy in Maximum Weighted Clique – Euro-Par 2024

30th International European Conference on Parallel and Distributed Computing (Euro-Par 2024) DOI: 10.1007/978-3-031-69583-4_7PDF Version Abstract The Maximum Weighted Clique(MWC) problem remains challenging […]

Invited Talk – Enabling high-performance large-scale irregular computations by Maciej Besta
Published 8 June 2021

Invited Talk – Enabling high-performance large-scale irregular computations by Maciej Besta

17 June 2021 Abstract: Large graphs are behind many problems in today’s computing landscape. Thegrowing sizes of such graphs, reaching 70 trillion […]

Parallel Computing Training Session 2023
Published 3 March 2023

Parallel Computing Training Session 2023

Date: 6th March 2023Location: CSB Training Room 02.017 Parallel computing is a key technology supporting high-performance computing (HPC) and data analytics. The […]

Post navigation

  • Previous post ParaGrapher Integrated to LaganLighter
  • Back to post list
  • Next post MS-BioGraphs on IEEE DataPort
Links
  • Jobs
  • People
  • Contact
  • Articles

Meet us —
Prof. Hans Vandierendonck
Computer Science Building
Queen's University Belfast
16A Malone Road
Belfast BT9 5BN
Northern Ireland, UK
Tel: +44 (0)28 9097 4654

© 2026 DIPSA: Data-Intensive Parallel Systems and Algorithms – All rights reserved

Powered by WP – Designed with the Customizr Theme

Manage Consent
To provide the best experiences, we use technologies like cookies to store and/or access device information. Consenting to these technologies will allow us to process data such as browsing behavior or unique IDs on this site. Not consenting or withdrawing consent, may adversely affect certain features and functions.
Functional Always active
The technical storage or access is strictly necessary for the legitimate purpose of enabling the use of a specific service explicitly requested by the subscriber or user, or for the sole purpose of carrying out the transmission of a communication over an electronic communications network.
Preferences
The technical storage or access is necessary for the legitimate purpose of storing preferences that are not requested by the subscriber or user.
Statistics
The technical storage or access that is used exclusively for statistical purposes. The technical storage or access that is used exclusively for anonymous statistical purposes. Without a subpoena, voluntary compliance on the part of your Internet Service Provider, or additional records from a third party, information stored or retrieved for this purpose alone cannot usually be used to identify you.
Marketing
The technical storage or access is required to create user profiles to send advertising, or to track the user on a website or across several websites for similar marketing purposes.
  • Manage options
  • Manage services
  • Manage {vendor_count} vendors
  • Read more about these purposes
View preferences
  • {title}
  • {title}
  • {title}