Skip to primary content
Skip to secondary content

DIPSA: Data-Intensive Parallel Systems and Algorithms

DIPSA: Data-Intensive Parallel Systems and Algorithms

Main menu

  • Home
  • Research
    • High-Performance Graph Processing
      • ParaGrapher
      • MS-BioGraphs
      • Subgraph Isomorphism
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
  • Publications
    • Articles
    • Dissertations
  • Source Code & Datasets
    • Source Code
    • Datasets
    • Technical Posts
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact

Tag Archives: pacobi

Brian Dandurand is offered a Marie Curie Individual Fellowship

Posted on 17 February 2024 by Hans Vandierendonck

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.

Posted in Uncategorised | Tagged high performance computing, machine learning, pacobi

Recent Posts

  • PaCoBi: Scaling Parallelism and Convexity Hurdles in Bi-Level Machine Learning
  • SoftNum Project Results
  • New Paper Accepted in IEEE Transactions on Emerging Topics in Computing
  • DIPSA at IPDPS’25
  • Sweeping AAAI’25 success

Recent Comments

  1. Hans Vandierendonck on Three PhD Positions in Data Analytics – RELAX Doctoral Network
  2. Graptor sources published | High-Performance Graph Processing on Graptor: Efficient Pull and Push Style Vectorized Graph Processing

This website is licensed under a Creative Commons Attribution 4.0 International License.

Proudly powered by WordPress