1055 search results - page 41 / 211 » Enumerations in computable structure theory |
DIGRA
2003
Springer
14 years 3 months ago
2003
Springer
This paper examines the computer game Harry Potter and the Philosopher’s Stone in relation to the novel with the same title. The analysis focuses on the temporal aspects of the ...
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
ICCV
1995
IEEE
14 years 1 months ago
1995
IEEE
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
IJCV
2006
13 years 10 months ago
2006
Suppose two perspective views of four world points are given and that the intrinsic parameters are known but the camera poses and the world point positions are not. We prove that t...
CIARP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. It is argued that the ability to generalise is the most important characteristic of learning and that generalisation may be achieved only if pattern recognition systems l...