We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
In this paper the problem of optical flow and occlusion mask estimation is aborded. To that end, we consider a multi-label representation of the optical flow and we define an ener...
Nicolas Papadakis, Antonio Baeza, Pau Gargallo, Vi...
This paper studies dissipativity for a class of infinite-dimensional systems, called pseudorational, in the behavioral context. A basic equivalence condition for dissipativity is e...
This paper studies the effect of heterogenous delays in networks of weakly pulse-coupled identical oscillators. We develop a new framework to study them by constructing a non-delay...