Sciweavers

429 search results - page 47 / 86
» Turing computations on ordinals
Sort
View
CSDA
2007
123views more  CSDA 2007»
14 years 9 months ago
Bayesian estimation of unrestricted and order-restricted association models for a two-way contingency table
In two-way contingency tables analysis, a popular class of models for describing the structure of the association between the two categorical variables are the so-called “associ...
G. Iliopoulos, Maria Kateri, Ioannis Ntzoufras
MM
2009
ACM
172views Multimedia» more  MM 2009»
15 years 4 months ago
Concept, content and the convict
This paper describes the concepts behind and implementation of the multimedia art work Alan01 / AlanOnline, which wakes up the 1952 criminally convicted Alan Turing as a piece of ...
Mika Luma Tuomola, Teemu Korpilahti, Jaakko Pesone...
CVPR
2008
IEEE
15 years 11 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...
IPL
2006
117views more  IPL 2006»
14 years 9 months ago
P systems without multiplicities of symbol-objects
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
Artiom Alhazov
MST
2007
90views more  MST 2007»
14 years 9 months ago
Optimal Semicomputable Approximations to Reachable and Invariant Sets
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...
Pieter Collins