91影视破解版

Skip to main content Skip to navigation

Biomedical Data Analytics News

Select tags to filter on

TIA Spotlight: Kesi Xu

For this week's Spotlight, we would like to highlight the career journey and current work of Kesi Xu, a Postgraduate Researcher in the centre whose work focuses on cell classification for histopathology. Read more.

Wed 02 Sept 2026, 11:49 | Tags: People

Reflections on MIUA 2026: Dublin, DCAFA, and Delivering Warwick鈥檚 Big Announcement

30th UK Conference on Medical Image Understanding and Analysis, Dublin (20th 鈥� 22nd July 2026)

I was lucky enough to get accepted for an oral presentation at this year鈥檚 Conference on Medical Image Understanding and Analysis which was the 30th Anniversary Conference and the first time it was held outside of the UK. The only problem being for a die-hard football fan that the day of travel was the world cup final, and we had to gamble on whether England would be there. Read more.

Thu 20 Aug 2026, 13:18

TIA Centre Guest Editors Launch Special Issue on AI in Cancer

We are pleased to share that TIA Centre researchers Adam Shephard and Shan E Ahmed Raza, together with Rose Wang (University of Missouri-Kansas City), are serving as Guest Editors for a new Cancers Special Issue,"Artificial Intelligence in Cancers: Enhancing Diagnosis and Treatment".

The Special Issue invites submissions on topics including computational pathology, medical imaging, radiology, genomics, multiomics, cancer detection, prognostic prediction, treatment planning, and clinical decision support, highlighting the growing role of AI in advancing cancer research and care.

Find out more and submit your work .

Fri 14 Aug 2026, 11:09 | Tags: People

Older news
Select tags to filter on

20 papers accepted at NeurIPS 2026

We are delighted to celebrate the 20 accepted papers at the , involving colleagues and students from the Department of Computer Science (DCS) at the 91影视破解版, together with their collaborators. NeurIPS is the leading international venue for AI and machine learning research and will be held on 6-12th December, 2026 in Sydney, Australia along with two satellite locations at Paris, France and Atlanta, United States of America.

20 NeurIPS Accepted Papers from DCS


 

The workshop Algorithms & Complexity @ Warwick took place at the 91影视破解版 on September 22-23, 2025 (see for more details).

The aim of the event was to highlight several recent exciting advances in the field of Algorithms and Complexity, to facilitate interactions within the research community, and to provide an excellent opportunity for Theory researchers (including academics, postdocs, and students) to connect and collaborate.

We had a fantastic list of invited speakers by renowned world experts: (Technical University of Catalonia), (University of Bath), (University of Pennsylvania), (Max Planck Institute for Informatics), (Charles University in Prague), (University of Sheffield and University of Haifa), (University of Oxford), (University of Cambridge), (University of Toronto).

Tue 23 Sept 2025, 21:00 | Tags: Conferences Research Theory and Foundations

Best Paper Award at ACM Mobihoc 2024

co-authored by Arpan MukhopadhyayLink opens in a new window has received the Best Paper Award at . Mobihoc is a premier international conference on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing. The other authors in the paper are Samira Ghanbarian (uWaterloo), Ravi R. Mazumdar (uWaterloo), and Fabrice Guillemin (Orange Labs, France).

The paper addresses the problem of optimally allocating processors to parallelisable tasks having arbitrary concave speed-up functions. In general, determining the optimal number of processors to allocate to each task in an online fashion is a hard problem since allocating too many processors to one job will make those processors unavailable to other jobs whereas allocating too few processors will result in a small speed-up for the job. The paper proposes a simple randomised algorithm for determining the optimal number of processors to allocate to each job without requiring preemption (or repacking). It shows that the proposed algorithm is asymptotically optimal as the number of processors becomes large (which is often the case in modern clouds) and is also robust to variations in the job size distribution. This is the first time such an algorithm has been found in the literature.


Older news

Let us know you agree to cookies