Algorithms and Machine Learning, which is provided by Dr He Sun's
5-year £1.51M EPSRC Fellowship "Efficient Spectral Algorithms for
Massive and Dynamic Graphs". This fellowship aims at advancing our
understanding of spectral techniques, investigating new spectral
algorithms for fundamental graph problems in different settings, and
implementing and evaluating these algorithms on real-world data sets.
This post will involve working on algorithmic aspects of graph
clustering, including developing new notions of graph and hypergraph
clustering, designing efficient algorithms for graph clustering in
various settings, as well as building connections between graph
clustering and other problems. There will be opportunities to take
responsibility for supervising PhD students and collaborating with the
project partners on other related research problems, all within the
freedom of an academic research environment. The post will offer many
opportunities for travel and collaborating with the four project
partners of the Fellowship (Cambridge, ETH Zurich, UW, and the Turing
Institute).
The post is full time, fixed-term for 3 years with a possibility of extension.
Closing date 9th April 2020 at 5pm.
Link to the call and application:
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=051734
**********************************************************
*
* 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
