Sort by
Refine Your Search
-
of probabilistic and extremal combinatorics, structural graph theory and algorithms. We study problems on discrete structures such as graphs, permutations, posets or set systems using probabilistic, structural and
-
. During the PhD, you will work on topics at the intersection of probabilistic and extremal combinatorics, structural graph theory and algorithms. We study problems on discrete structures such as graphs
-
or hard constraints, operational bounds (voltage limits, capacity, phase balance), and network topology through graph neural network architectures. You will build validated benchmark datasets and an
-
representations, and flow matching) for uncertainty-aware 3D reconstruction of coronary anatomy from 2D X-ray angiography; develop physics-informed neural networks and graph-based neural operators for fast
-
learning pipelines for multilayer segmentation and nanoscale transistor classification from microscopy images; (b) Designing graph-based inference models capable of reconstructing higher-level logical blocks
-
, Create insightful graphs and other graphical tools to present outcomes back to farmers, Develop reporting for specific groups of farmers that are for instance in a specific supply chain or a learning
-
generalized framework for extremal structural causal models on arbitrary directed acyclic graphs. Our new models will be able to incorporate non-standard extreme directions, which permits the modeling