Abstract. The expressiveness of a lot of image analysis algorithms depends on the question whether shape information is preserved during digitization. Most existing approaches to a...
Scalable information retrieval systems are crucial to meeting the growing volumes of data. We describe work done to facilitate scalability by reducing duplication, providing integ...
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] < ∞. We...
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...