Sort by
Refine Your Search
-
Listed
-
Country
-
Employer
-
Field
-
the ANR. PhD student in Graph Signal Processing for the Characterization of Multipolar Electrograms of Persistent Atrial Fibrillation. Responsible for a significant proportion of brain strokes, atrial
-
) have some exposure to (hyper)graph theory, network science, and/or reaction mechanism/CRN studies. Candidates who do not meet all of these criteria should not feel discouraged. If you are interested in
-
PhD Position in Theoretical Algorithms or Graph and Network Visualization - Promotionsstelle (m/w/d)
interfaces. Topics of interest include: Planar and geometric graph algorithms Approximation and parameterized algorithms Clustering, embeddings, and structural graph theory Computational complexity and
-
programs. Alternatively, Mathematics, Computer Science, Computer Engineering, Electrical Engineering, or a similar field; Strong mathematical background: basic knowledge of graph theory and excellent
-
a similar field; Strong mathematical background: basic knowledge of graph theory and excellent background in linear algebra, finite fields and rings; Strong background in digital hardware design and
-
, or a similar field; Strong mathematical background: basic knowledge of graph theory and excellent background in linear algebra, finite fields and rings; Strong background in digital hardware design and
-
because explainability is vital in health and medicine. Moreover, it leverages preferring simpler theories over complex ones if both give comparable levels of accuracy. Furthermore, it leverages the power
-
use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our activities are experimentally driven and
-
. This research direction requires advancements in modern probabilistic tools, including spatial random graphs, random walks, and Markov chains. The position is hosted in the Leibniz Junior Research Group
-
. This research direction requires advancements in modern probabilistic tools, including spatial random graphs, random walks, and Markov chains. The position is hosted in the Leibniz Junior Research Group