Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
In this paper we propose a novel approach to the detection of on-line handwritten text lines based on dynamic programming. We try to find the paths with the minimum cost between ...
A Group Key Agreement protocol is a process to establish a cryptographic key for a group of participants over an open network. In this paper, we propose a group key agreement(CAGKA...