Modal Learning in a Neural Network
London Metropolitan University
Dominic Palmer-Brown presents an application of the snap-drift modal learning algorithm developed in recent years by Lee and Palmer-Brown. The […]
Formal Sciences
4
Triangulations of the sphere, bitrades and abelian groups
Royal Holloway, University of London
Triangulations of the sphere, bitrades and abelian groups Professor Simon Blackburn, Royal Holloway, London.
Reconstruction and quantization of Riemannian structures
Queen Mary University of London
Shahn Majid discusses his study into how the Riemannian structure on a manifold can be usefully reconstructed from its codifferential.
Modality, mathematics, and logic
Columbia University
Justin Clarke-Doane joined the Columbia department in 2014. His work centers on metaphysical and epistemological problems surrounding apparently a priori […]
Open innovation and linked data
University of Oxford
Sir Nigel Shadbolt is Principal of Jesus College, Oxford and Professorial Research Fellow in the Department of Computer Science, University […]
Data-driven Learning in an Incremental Grammar Framework
Queen Mary University London
Dr. Matthew Purver, Queen Mary, University of London Data-Driven Learning in an Incremental Grammar Framework Matthew Purver, Arash Eshghi & […]
Automatic affect analysis
Queen Mary University of London
Dr Hatice Gunes, Queen Mary, University of London H. Gunes and B. Schuller, Introduction to the Special Issue on Affect […]
Analogy – Random walks through the Sahara Desert
Queen Mary University London
Professor Charles R. Leedham-Green, Queen Mary, University of London. The Product replacement algorithm, an algorithm within computational group theory, gene…
Self-avoiding trails on the square lattice
Queen Mary University London
Dr Thomas Prellberg, Queen Mary, University of London A. Bedini, A. L. Owczarek and T. Prellberg, “Self-avoiding trails with nearest […]
Workflow Satisfiability Problem
Royal Holloway, University of London
Gregory Gutin, Royal Holloway University of London, On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem