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...
A convenient form of necessary and sufficient conditions of viability for differential games with linear dynamics is proposed. These conditions are utilized to construct maximal vi...
Data sources for data integration often come with spurious schema definitions such as undefined foreign key constraints. Such metadata are important for querying the database and ...
Jana Bauckmann, Ulf Leser, Felix Naumann, Veroniqu...
In order to deal with inconsistent databases, a repair semantics defines a set of admissible database instances that restore consistency, while staying close to the original insta...
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...