Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goo...
This paper deals with the reduction of flicker in old films. This artifact appears as global, quick and random variations of the luminance and contrast between consecutive frames ...
Abstract-- We derive the maximum entropy of a flow (information utility) which conforms to traffic constraints imposed by a generalized token bucket regulator, by taking into accou...
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...