نتایج جستجو برای: conforming run length
تعداد نتایج: 418182 فیلتر نتایج به سال:
Given a finite nonempty sequence S of integers, write it as XY k, where Y k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The curling number conjecture is that if one starts with any initial sequence S, and extends it by repeatedly appending the curling number of the current sequence, the sequence will eventually reach 1. The conjecture remains open. ...
Many thinning algorithms for 2D binary images, or modifications of existing ones, have been proposed in recent years. The one given herein is surprisingly simple compared to most of them, and still it has theoretically favorable properties. Actually, it provides a connected single-pixel in width whenever possible well-centered homototic skeleton that allows shapes to be nearly reconstructed. In...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید