Month: September 2017

Stephen McKenna (Dundee): Recognising Interactions with Objects and People (School Seminar)

CANCELLED! This talk has been postponed, due to the ongoing strike. Abstract: This talk describes work in our research group using computer vision along with other sensor modalities to recognise (i) actions in which people manipulate objects, and (ii) social interactions and their participants. Activities such as those involved in food preparation involve interactions between Stephen McKenna (Dundee): Recognising Interactions with Objects and People (School Seminar)

Emma Hart (Edinburgh Napier): Lifelong Learning in Optimisation (School Seminar)

Abstract: The previous two decades have seen significant advances in optimisation techniques that are able to quickly find optimal or near-optimal solutions to problem instances in many combinatorial optimisation domains. Despite many successful applications of both these approaches, some common weaknesses exist in that if the nature of the problems to be solved changes over Emma Hart (Edinburgh Napier): Lifelong Learning in Optimisation (School Seminar)

Jessie Kennedy (Edinburgh Napier): Visualization and Taxonomy (School Seminar)

Abstract: This talk will consider the relationship between visualization and taxonomy from two perspectives. Firstly, how visualization can aid understanding the process of taxonomy, specifically biological taxonomy and the visualization challenges this poses. Secondly, the role of taxonomy in understanding and making sense of the growing field of visualization will be discussed and the challenges Jessie Kennedy (Edinburgh Napier): Visualization and Taxonomy (School Seminar)

Barnaby Martin (Durham): The Complexity of Quantified Constraints (School Seminar)

Abstract: We elaborate the complexity of the Quantified Constraint Satisfaction Problem, QCSP(A), where A is a finite idempotent algebra. Such a problem is either in NP or is co-NP-hard, and the borderline is given precisely according to whether A enjoys the polynomially-generated powers (PGP) property. This reduces the complexity classification problem for QCSPs to that Barnaby Martin (Durham): The Complexity of Quantified Constraints (School Seminar)

Maja Popović (Humboldt-Universität zu Berlin): (Dis)similarity Metrics for Texts (School Seminar)

Abstract: Natural language processing (NLP) is a multidisciplinary field closely related to linguistics, machine learning and artificial intelligence. It comprises a number of different subfields dealing with different kinds of analysis and/or generation of natural language texts. All these methods and approaches need some kind of evaluation, i.e. comparison between the obtained result with a Maja Popović (Humboldt-Universität zu Berlin): (Dis)similarity Metrics for Texts (School Seminar)

Semantics for probabilistic programming, Dr Chris Heunen

Semantics for probabilistic programming, Dr Chris Heunen 03.10.17, 1pm, Room JCB 1.33B Abstract: Statistical models in e.g. machine learning are traditionally expressed in some sort of flow charts. Writing sophisticated models succintly is much easier in a fully fledged programming language. The programmer can then rely on generic inference algorithms instead of having to craft one for Semantics for probabilistic programming, Dr Chris Heunen