Cancer Research UK is funding a study to examine the use of machine learning to assist pathologists and improve the early detection of oral cancer.

We are very excited to work on this project with Dr Khurram and his team at Sheffield. Early detection of cancer is a key focus area of research in our lab and this award by CRUK adds to the portfolio of research at the TIA lab on early detection of cancer.

The pilot project will pave the way towards the development of a tool that can help identify pre-malignant changes in oral dysplasia, crucial for the early detection of oral cancer. Successful completion of this project carries significant potential for saving lives and improving patient healthcare provision. -- Professor Nasir Rajpoot

The research is led by Dr Ali Khurram at the University of Sheffield with Professor Nasir Rajpoot from the University of Warwick as the co-Principal Investigator. Other co-investigators and collaborators include Professor Hisham Mehanna and Dr Paul Navkivell from the University of Birmingham and Dr Jacqueline James from Queen’s University Belfast.

Warwick's Department of Computer Science has been awarded a new research grant to develop a machine learning solution for dynamic forecasting of available capacity on road networks. The developed software is planned to be integrated within the TfWM's Regional Transport Coordination Centre for adaptive route planning and traffic management mitigation against disruptions, incidents and roadworks.

The “5G Enabled Dynamic Network Capacity Manager” project is in collaboration with commercial partners, Blacc, Immense, one.network, and O2. The team has won the WM5G’s transport competition to leverage 5G networks for near real-time AI based modelling.

Prof. Hakan Ferhatosmanoglu is leading the development of the scalable ML solution to forecast residual capacities in a dynamic spatio-temporal graph. The solution is designed to benefit from high-granular and low-latency data feeds from 5G cellular and sensor data enabling congestion to be accurately monitored, modelled, and predicted.

We are pleased to report that members of the department's Theory and Foundations research theme have had 6 papers accepted to the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA is the top international conference on algorithms research. The papers are:

• "A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy" by Marcel Dall'Agnol, Tom Gur, Oded Lachish;
• "On a combinatorial generation problem of Knuth" by Arturo Merino, Ondřej Mička, Torsten Mutze;
  
• "Dynamic Set Cover: Improved Amortized and Worst-Case Update Times" by Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu;
• "Online Edge Coloring Algorithms via the Nibble Method" by Sayan Bhattacharya, Fabrizio Grandoni, David Wajc;
• "FPT Approximation for FPT Problems" by Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi.
• "Polyhedral value iteration for discounted games and energy games" - Alexander Kozachinskiy