Skip to main content Skip to navigation

Data Science, Systems and Security News

Select tags to filter on

Full Aero-Engine Compressor Visualization Selected as Finalists for the SciVis Showcase at the Supercomputing 2022 Conference

Numerical simulations and visualizations developed by researchers from the High Performance and Scientific Computing (HPSC) group led by Dr. Gihan Mudalige at Warwick’s Department of Computer Science in collaboration with Rolls-Royce, PPCU Hungary and Universities of Surrey and Birmingham have been selected as one of the six finalists for the Scientific Visualization and Data Analytics Showcase at the 2022 Supercomputing (SC) Conference, held in Dallas TX. SC is the premier international conference on supercomputing providing a major forum for presenting the highest level of accomplishments in high-performance computing, networking, storage, and analysis. It is held annually in the US and attended by over 10000 attendees from all over the world. A video regarding the work can be found here.

Mon 07 Nov 2022, 10:38 | Tags: Conferences Research Data Science Systems and Security

Best Paper Award at AISTATS 2022

Congratulations to Harita Dellaporta for receiving the Best Paper Award at the premier conference in Artificial Intelligence and Statistics (AISTATS) 2022 for her paper on Robust Bayesian Inference for Simulator-based Models via the MMD Posterior Bootstrap.


Best Student Paper Award at ITCS 2022

We are delighted to announce that Peter Kiss, a PhD student in the Theory and Foundations Research Division, has won the Best Student Paper Award at the Innovations in Theoretical Computer Science (ITCS) 2022 conference for his single-author paper on "Deterministic Dynamic Matching in Worst-Case Update Time". Computing a maximum matching in a graph is one of the most fundamental problems in design and analysis of algorithms. The paper makes important progress on this problem in a setting where the input graph is changing over time via a sequence updates, and one wishes to maintain a large matching efficiently in such a dynamic graph. Along the way, the paper develops a general purpose technique for converting any dynamic algorithm with amortised update time into one with worst-case update time, provided the initial algorithm is able to handle a more general form of batch updates.

Tue 18 Jan 2022, 18:21 | Tags: Conferences Research Theory and Foundations

Latest news Newer news Older news