1192 search results - page 46 / 239 » Computing Weakest Readings |
107
click to vote
CIE
2005
Springer
15 years 5 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
AML
2008
14 years 12 months ago
2008
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
182
click to vote
IADIS
2008
15 years 1 months ago
2008
The paper is about the methodology of e-learning applied in computer vision. There exists an interactive textbook of computer vision in Slovak language but the only difference bet...
IDEAS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper, we introduce a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a...
EUROPAR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We describe compiler and run-time optimisations for effective autoparallelisation of C++ programs on the Cell BE architecture. Auto-parallelisation is made easier by anno...