Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Employer
- CNRS
- Inria, the French national research institute for the digital sciences
- Radboud University
- University of Antwerp
- Wageningen University & Research
- Amsterdam UMC
- Delft University of Technology (TU Delft)
- KU LEUVEN
- Monash University
- NTNU Norwegian University of Science and Technology
- Tilburg University
- University of Exeter
- University of Twente (UT)
- Aalborg University
- Abertay University
- Academic Europe
- Constructor Knowledge Labs gGmbH
- Forschungszentrum Jülich
- Grenoble INP - Institute of Engineering
- Leibniz-Institut für Analytische Wissenschaften – ISAS – e.V.
- Leipzig University •
- Luleå tekniska universitet
- Manchester Metropolitan University
- NOVA.id.FCT- Associação para a Inovação de Desenvolvimento da FCT
- Norwegian University of Life Sciences (NMBU)
- Politecnico di Milano
- Purdue University
- SciLifeLab
- The University of Manchester
- Universitat Politècnica de Catalunya (UPC)- BarcelonaTECH
- University of East Anglia
- University of Florida
- University of Groningen
- University of Newcastle
- University of Oxford
- University of Texas at El Paso
- University of Warwick
- University of Warwick;
- 28 more »
- « less
-
Field
-
Inria, the French national research institute for the digital sciences | Villers les Nancy, Lorraine | France | about 24 hours ago
identify the communication structures in graph colorings. In [4], it is shown that when the number of colors is sufficiently large, the graph itself suffices to generate is colorings, but we need
-
Inria, the French national research institute for the digital sciences | Villers les Nancy, Lorraine | France | about 24 hours ago
on Automata, Languages, and Programming (ICALP 2022), Dagstuhl, Germany, pp. 119:1–119:19, doi:10.4230/LIPIcs.ICALP.2022.119. [4] Ross Duncan, Aleks Kissinger, Simon Perdrix & John van de Wetering (2020): Graph
-
. Depending on the candidate's background and research direction, approaches may include computer vision, representation learning, graph neural networks, multimodal learning and scientific machine learning. A
-
hydraulic modelling Asset management and infrastructure resilience Artificial intelligence and machine learning Trustworthy or explainable AI Network science and graph-based methods Decision-support systems
-
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
-
Number 10267010007 Is the Job related to staff position within a Research Infrastructure? No Offer Description Mission: Develop a doctoral thesis on the mechanistic interpretability of graph neural
-
into insight). To tackle this, the research blends ideas from knowledge graphs, stream processing, database theory, logic, edge and cloud computing, and Artificial Intelligence into a single coherent framework
-
properties are proved, refuted by counterexample, or reported as an explainable gap. All of it is written in a domain-specific language whose syntax trees and graphs we keep in a projectional editor (JetBrains
-
models ranging from baseline approaches to graph neural networks. You will also oversee the open release of project datasets, models, code and documentation. The successful candidate will join Oxford's