|
|
|
|
|
Aurelien Bloch, Simone Casale-Brunet and Marco Mattavelli
The performance of programs executed on heterogeneous parallel platforms largely depends on the design choices regarding how to partition the processing on the various different processing units. In other words, it depends on the assumptions and paramete...
ver más
|
|
|
|
|
|
|
|
|
Jesús Calvillo, Harm Brouwer and Matthew W. Crocker
Decades of studies trying to define the extent to which artificial neural networks can exhibit systematicity suggest that systematicity can be achieved by connectionist models but not by default. Here we present a novel connectionist model of sentence pr...
ver más
|
|
|
|
|
|
|
|
|
Stefan Wagenpfeil, Paul Mc Kevitt and Matthias Hemmje
Multimedia feature graphs are employed to represent features of images, video, audio, or text. Various techniques exist to extract such features from multimedia objects. In this paper, we describe the extension of such a feature graph to represent the me...
ver más
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 10
In our previous publications, we considered a simplified version of the definition of omega-automata that define omega-languages compared to the classics. However, despite this ?simplification?, such a definition makes it possible to specify the subclass...
ver más
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 10
In this paper, we continue the topic related to the special binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages); this is so called equivalence relation at infinity. We have formulat...
ver más
|
|
|
|