نتایج جستجو برای: valued lempel
تعداد نتایج: 40819 فیلتر نتایج به سال:
We present a framework facilitating the implementation and comparison of text compression algorithms. We evaluate its features by a case study on two novel compression algorithms based on the Lempel-Ziv compression schemes that perform well on highly repetitive texts.
Neutrality is important in natural, molecular and artificial evolution. This work studies how local neutral degree varies over the genospace in a simple class of Lindenmayer-systems, and investigates whether this variation relates to Lempel-Ziv complexity of the phenotype.
In this paper we give an infinite family of strings for which the length of the Lempel-Ziv’77 parse is a factor Ω(log n/ log log n) smaller than the smallest run-length grammar.
We present an algorithm that computes the Lempel-Ziv decomposition in O(n(log σ+log log n)) time and n log σ+ǫn bits of space, where ǫ is a constant rational parameter, n is the length of the input string, and σ is the alphabet size. The n log σ bits in the space bound are for the input string itself which is treated as read-only.
On the complexity of master problems Emergence on decreasing sandpile models 14:35 Kosolobov Durand, Romashchenko Faster lightweight Lempel-Ziv parsing Quasiperiodicity and non-computability in tilings On the Complexity of Noncommutative Polynomial Factorization
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید