๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Matching for Run-Length Encoded Strings

โœ Scribed by Alberto Apostolico; Gad M Landau; Steven Skiena


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
300 KB
Volume
15
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Edit distance of run-length encoded stri
โœ Ora Arbell; Gad M. Landau; Joseph S.B. Mitchell ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 745 KB

Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l + |Y |k) time algorithm that computes their edit distance.

Classification of run-length encoded bin
โœ T. Ravindra Babu; M. Narasimha Murty; V.K. Agrawal ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

In classification of binary featured data, distance computation is carried out by considering each feature. We represent the given binary data as run-length encoded data. This would lead to a compact or compressed representation of data. Further, we propose an algorithm to directly compute the Manha

Template-based rendering of run-length-
โœ Lee, Cheol-Hi ;Koo, Yun-Mo ;Shin, Yeong Gil ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 206 KB

Template-based volume rendering is a technique to accelerate volume ray casting. It does not trade off image quality for rendering speed. However, it still falls short of interactive manipulation of volume data, mainly owing to the ray-by-ray volume access pattern and the long ray path in the transp

A posteriori scaling of run length encod
โœ Ph. Coueignoux ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science โš– 254 KB

Scaling run-length encoded binary patterns is quite useful in some instances of computer graphics, such as phototypesetting with variable-sized characters. A very simple method can be used to perform the scaling, which separates scaling along the direction of the runs and along the perpendicular. Th