Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Due to the robustness of Gabor features against local distortions caused by variance of illumination, expression and pose, they have been successfully applied for face recognition....
We describe our contribution to the Generation Challenge 2010 for the tasks of Named Entity Recognition and coreference detection (GREC-NER). To extract the NE and the referring e...
This paper demonstrates that several known sequence kernels can be expressed in a unified framework in which the position specificity is modeled by fuzzy equivalence relations. In ...
Ulrich Bodenhofer, Karin Schwarzbauer, Mihaela Ion...