1917 search results - page 40 / 384 » The York Abstract Machine |
CIE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
PDCAT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Beowulf-class clusters use a diverse collection of queue management software, and interconnect technology, often causing inter-cluster operability issues. We present a Un...
AVBPA
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We report about some experiments on the fingerprint database NIST-4 using different combinations of Support Vector Machine (SVM) classifiers. Images have been preprocesse...