Sciweavers

886 search results - page 80 / 178
» On the Autoreducibility of Random Sequences
Sort
View
DAM
2010
92views more  DAM 2010»
13 years 8 months ago
Average-case analysis of incremental topological ordering
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...
Deepak Ajwani, Tobias Friedrich
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 7 months ago
Biased Skip Lists
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...
ICIP
2000
IEEE
14 years 9 months ago
Flicker Reduction in Old Films
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 ...
Valery Naranjo, Antonio Albiol
CORR
2006
Springer
115views Education» more  CORR 2006»
13 years 8 months ago
Entropy-optimal Generalized Token Bucket Regulator
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...
Ashutosh Deepak Gore, Abhay Karandikar
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
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 ...
Abhijit Pol, Tamer Kahveci