ss265

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)

PhD Studentship: Reasoning about Racy Programs under Relaxed Consistency

A PhD studentship on “Reasoning about Racy Programs under Relaxed Consistency” is available in the School of Computer Science at the University of St Andrews, funded by Microsoft Research and EPSRC. The project will involve developing reasoning principles and tools for relaxed memory consistency settings. This is a key problem in shared-memory concurrency at the PhD Studentship: Reasoning about Racy Programs under Relaxed Consistency

PhD Studentship: Reasoning about Racy Programs under Relaxed Consistency

A PhD studentship on “Reasoning about Racy Programs under Relaxed Consistency” is available in the School of Computer Science at the University of St Andrews, funded by Microsoft Research and EPSRC. The project will involve developing reasoning principles and tools for relaxed memory consistency settings. This is a key problem in shared-memory concurrency at the PhD Studentship: Reasoning about Racy Programs under Relaxed Consistency