CIS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract—The growth in practical applications for iris biometrics has been accompanied by relevant developments in the underlying algorithms and techniques. Along with the resear...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
We show that every real low for Demuth randomness is of hyperimmune-free degree.
CIE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
CIE
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
CIE
2009
Springer
14 years 7 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,...