We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, āComputational Complexity in Non-Turing Models of Computationā...
This paper reports on a panel discussion held during the Educatorsā Symposium at MODELSā2009. It shortly explains the context provided for the discussion and outlines the state...
In this paper, we propose a generative model to automatically discover the hidden associations between topics words and opinion words. By applying those discovered hidden associat...
Floating point arithmetic is a subject all too often ignored, yet, for agent-based models in particular, it has the potential to create misleading results, and even to influence e...
J. Gareth Polhill, Luis R. Izquierdo, Nicholas Mar...
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...