In this paper we study one-clock priced timed automata in which prices can grow linearly ( ˙p = k) or exponentially ( ˙p = kp), with discontinuous updates on edges. We propose E...
Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Ni...
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Despite significant progress in deformable model fitting over the last decade, the problem of efficient and accurate person-independentface fitting remains a challenging probl...
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...