Informatics, University of Edinburgh. This post is part of He Sun's
EPSRC Fellowship for Efficient Spectral Graph Algorithms with a total
award of 1.5+ million pounds, and the post holder is to work on
algorithmic and machine learning's aspect of the project.
Our research group, consisting of 5 researchers at the moment, works
on different aspects of spectral graph theory and its application.
This includes researching spectral digraph theory, designing efficient
spectral algorithms for graph problems in TCS and machine learning, as
well as developing Spectral Toolkit of Algorithms for Graphs (STAG),
which is the first C++ based open-source library for spectral graph
algorithms. More information about the group activities can be found
from the project webpage https://bit.ly/3TdMYxG, and the STAG website
https://staglibrary.io/.
We welcome candidates with research experience in algorithms,
unsupervised learning, or spectral analysis to apply for the post.
More information about the post can be found at https://bit.ly/3T8Xkyy
Please feel free to send an email to h.sun@ed.ac.uk for informal inquiry.
Deadline for application: 2 December 2022, and the start date of the
post is negotiable.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
