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

Accelerating scientific discovery using domain adaptive language modelling (PhD Thesis)
Published 3 July 2023

Accelerating scientific discovery using domain adaptive language modelling (PhD Thesis)

Thesis on QUB Pure PortalThesis in PDF Format Author: Dimitrios Christofidellis Research has been conducted for numerous centuries but recent advances in […]

ROMA: Run-Time Object Detection To Maximize Real-Time Accuracy
Published 1 January 2023

ROMA: Run-Time Object Detection To Maximize Real-Time Accuracy

This is a follow-up work on TOD, which selects one of multiple deep neural networks (DNNs) to perform real-time video analytics (object […]

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 […]

Invited Talk: Adaptiveness and Lock-free Synchronization in Parallel Stochastic Gradient Descent by Karl Bäckström
Published 28 May 2021

Invited Talk: Adaptiveness and Lock-free Synchronization in Parallel Stochastic Gradient Descent by Karl Bäckström

3 June 2021 Abstract: The emergence of big data in recent years due to the vast societal digitalization and large-scale sensor deployment has entailed […]

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