Sciweavers

4355 search results - page 23 / 871
» Increasing Kolmogorov Complexity
Sort
View
IPL
2007
100views more  IPL 2007»
13 years 8 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li
AVI
2010
13 years 10 months ago
Showtime: increasing viewer understanding of dynamic network visualisations
Visualisations of dynamic networks are animated over time, reflecting changes in the underlying data structure. As viewers of these visualisations, it is up to us to accurately pe...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 8 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
13 years 10 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
FCS
2006
13 years 10 months ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems