Outstanding Thesis and Outstanding Paper Prizes
Steve Furber Medal for Outstanding Doctoral Thesis in Computer Science
Each year, at the Research Students' Symposium, a prize is awarded for the outstanding thesis for which a PhD has been awarded.
Rules for entry can be found in the PGR Handbook (Chapter 17) located here.
Steve Furber Medal winners
- 2020: Ghader Kurdi - Generation and Mining of Medical, Case-Based Multiple Choice Questions
- 2019: Henry Reeve - Learning in high dimensions with asymmetric costs
- 2018: Sarah Nogueira - Quantifying the Stability of Feature Selection
- 2017: (joint winner) Sukru Eraslan - Eye tracking scanpath trend analysis on web pages; and
- 2017: (joint winner) Nikolaos Nikolaou - Cost-sensitive boosting: a unified approach
- 2016: (joint winner) Patrick Koopmann - Practical Uniform Interpolation for Expressive Description Logics
- 2016: (joint winner) Konstantinos Sechidis - Hypothesis Testing and Feature Selection in Semi-Supervised Data
- 2015: Georgios Kontonatsios - Automatic Compilation of Bilingual Terminologies from Comparable Corpora
- 2014: Maytham Alabbas - Textual entailment for modern standard Arabic
- 2013: Adam Pocock - Feature Selection via Joint Likelihood
- 2012: Yavor Nenov Computability of Euclidean Spatial Logics
- 2011: Pavel Klinov Practical Reasoning in Probabilistic Description Logic
- 2010: Not Awarded
- 2009: Gwenn Englebienne, Animating Faces from Speech
- 2008 (joint winner): Birte Glimm, Querying Description Logic Knowledge Bases
- 2008 (joint winner): Paolo Missier, Modelling and Computing the Quality of Information in e-Science
- 2007: Gilles Daniel, Asynchronous Simulations of a Limit Order Book
- 2006: Chris Armstrong, CFG: A CSP-Based Framework Generator for Scientific Coupled Models
- 2005: Tomaz Felicijan, Quality-of-Service for Asynchronous On-Chip Networks
- 2004: Konstantin Korovine, Knuth-Bendix Orders in Automated Deduction and Term Rewriting
- 2003: Nicola Gambino, Sheaf Interpretations for Generalised Predicative Intuitionistic Systems
- 2002: Rhodri H. Davies, Learning Shape: Optimal Models for Analysing Natural Variability
- 2001: Sergio Tessaris, Questions and Answers: Reasoning and Querying in Description Logic
- 2000: William Bainbridge, Asynchronous System-on-Chip Interconnect
- 1999: Simon Gibson, Efficient Radiosity Simulation using Perceptual Metrics and Parallel Processing
- 1998: Ian Horrocks, Optimising Tableaux Decision Procedures for Description Logics
- 1997: Rizos Sakellariou, On The Quest For Perfect Load Balance in Loop-Based Parallel Computations
Carole Goble Medal for Outstanding Doctoral Paper in Computer Science
Each year, at the Research Students' Symposium, a prize is awarded for the outstanding paper by a research student.
Rules for entry can be found in the PGR Handbook (Chapter 17) located here.
Carole Goble Medal winners
- 2020: Yuan Chai - Load balancing routing for wireless mesh network with energy harvesting
- 2019: Alaa Alahmadi - Evaluating the Impact of Pseudo-Colour and Coordinate System on the Detection of Medication-induced ECG Changes
- 2018: Mantas Mikaitis - Neuromodulated Synaptic Plasticity on the SpiNNaker Neuromorphic System
- 2016: Nikos Nikolaou - Cost Sensitive Boosting Algorithms: Do We really need them? Nikos Nikolaou, Nara Edakunni Meelis Kull, Peter Flach, and Gavin Brown, Machine Learning Journal, 104(2), 359 - 384, 2016.
- 2015: Fan-Lin Meng - A Profit Maximization Approach to Demand Response Management with Customers Behavior Learning in Smart Grid, Fan-Lin Meng and Xiao-Jun Zeng, accepted for publication in IEEE Transactions on Smart Grid 2015
- 2014: Patrick Koopmann - Forgetting Concept and Role Symbols in ALCH-Ontologies. Patrick Koopmann and Renate A. Schmidt, published in LPAR-19, LNCS 8312, pp. 552-567, 2013
- 2013: Paraskevas Yiapanis - Optimizing software runtime systems for speculative parallelization, by Paraskevas Yiapanis, Demian Rosas-Ham, Gavin Brown, Mikel Lujan, published in ACM Transactions on Architecture and Code Optimization 9(4):39 (2013)
- 2012: Hugh Steele - Constructing Fully Complete Models for Multiplicative Linear Logic, Andrea Schalk and Hugh Steele, in Logic in Computer Science 2012 (LICS2012), the 27th Annual IEEE Symposium.
- 2011: Yavor Nenov - On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann and Michael Zakharyaschev Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI 2011), AAAI Press, 2011, pp. 957--962.
- 2010 (joint winner): Yavor Nenov - On the Computability of Region-based Euclidean Logics, Yavor Nenov and Ian Pratt-Hartmann. Computer Science Logic, Lecture Notes in Computer Science, 2010, Volume 6247/2010, 439-453.
- 2010 (joint winner): Kevin Sharp - Dense Message Passing for Sparse Principal Component Analysis, Kevin Sharp and Magnus Rattray. Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS), Vol 9: 725-732.
- 2009: Nestan Tsiskaridze - Conflict Resolution, by Konstantin Korovin, Nestan Tsiskaridze and Andrei Voronkov. Proceedings of the 15th international conference on Principles and Practice of Constraint Programming (CP 2009): 509-523.
- 2008: Richard Pearson - A Comprehensive Re-Analysis of the Golden Spike Data: Towards a Benchmark for Differential Expression Methods. BMC Bioinformatics 2008, 9:164.
- 2007: Robin Houston - Finite products are Biproducts in a Compact Closed Category. Journal of Pure and Applied Algebra Volume 212, Issue 2, February 2008, Pages 394-400.
- 2006: Julian Seidenberg - Web Ontology Segmentation: Analysis, Classification and Use. Proceedings of The 15th International World Wide Web Conference, WWW2006
- 2005: Xuejun Liu - X. Liu, M. Milo, N.D. Lawrence and M. RattrayA tractable probabilistic model for Affymetrix probe-level analysis across multiple chips. Bioinformatics 21, 3637-3644 (2005).
- 2004: Omaima Bamasak - O. Bamasak, N. Zhang A Secure Proxy Signature Protocol for Agent-Based M-Commerce Applications. Proc. Ninth IEEE Symposium on Computers and Communications, 2004.
- 2003: Delia Critchlow - D. Critchlow, N. Zhang. Security-Enhanced, Accountable, Anonymous PKI Certificates for Mobile E-commerce. Computer Networks 45(4): 483-503 (2004).
- 2002: Lilia Georgieva - L. Georgieva, U. Hustadt, R. A. Schmidt. A. Hyperresolution for Guarded Formulae. Journal of Symbolic Computation, Volume 36, Issues 1-2, (July - August 2003),pp. 163-192. 2003.
- 2001: Rhodri Davies - R.H. Davies, C.J. Twining, T.F. Cootes, J. C. Waterton and C.J. Taylor. A Minimum Description Length Approach to Statistical Shape Modelling. IEEE Transactions on Medical Imaging. May 2002.
- 2000:Konstantin Korovin - K. Korovin, A. Voronkov. A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering, Proc. Logic in Computer Science (LICS), 291-302, 2000.
- 1999: Mike Lewis - M. Lewis, J. Garside, L. Brackenbury. Reconfigurable Latch Controllers for Low Power Asynchronous Circuits, Proc. Async, IEEE Press, 1999.
- 1998: Tom Duckett - T. Duckett, U. Nehmzow. Mobile Robot Self-Localization and Measurement of Performance in Middle Scale Environments, J. Robotics and Autonomous Systems, Vol 24, No 1-2, 1998.
- 1997: Willem Visser - W. Visser, H. Barringer, D. Fellows, G. Gough, A. Williams. Efficient CTL* Model Checking for the Analysis of Rainbow Designs, Proc. Conference on Advances in Hardware Design and Verification (CHARME), 128-145, 1997.