This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
d abstract Marc Andries, Leiden University Luca Cabibbo, University of Romey Jan Paredaens, University of Antwerpz Jan Van den Bussche, INRIAx In the context of object databases...
Marc Andries, Luca Cabibbo, Jan Paredaens, Jan Van...
We consider the problem of decoupling translation and rotation for a collection of 3D data related to 2D images by a projection. The main contribution is to show that equations de...
Jean-Yves Guillemaut, Alberto S. Aguado, John Illi...
Affordances elude ontology. They have been recognized to play a role in categorization, especially of artifacts, but also of natural features. Yet, attempts to ontologize them face...