We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe...
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
The paper describes a simple but effective framework for visual object tracking in video sequences. The main contribution of this work lies in the introduction of a case-based rea...