Results 1  10
of
743,142
Run Length Codes
"... Run length codes are useful for the compression of binary data. Suppose you have a binary datavector. If the rst sample in the datavector is \0", then there will be positive integers r1;r2;:::;r k (the run lengths) such that the datavector will consist of r1 zeroes, followed by r2 ones, fol ..."
Abstract
 Add to MetaCart
Run length codes are useful for the compression of binary data. Suppose you have a binary datavector. If the rst sample in the datavector is \0", then there will be positive integers r1;r2;:::;r k (the run lengths) such that the datavector will consist of r1 zeroes, followed by r2 ones
Simulation Run Length Planning
 In Proceedings of the 1989 Winter Simulation Conference
, 1989
"... To design a stochastic simulation experiment, it is helpful to have an estimate of the simulation run lengths required to achieve desired statistical precision. Preliminary estimates of required run lengths can be obtained by approximating the stochastic model of interest by a more elementary Markov ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
To design a stochastic simulation experiment, it is helpful to have an estimate of the simulation run lengths required to achieve desired statistical precision. Preliminary estimates of required run lengths can be obtained by approximating the stochastic model of interest by a more elementary
RunLength FMindex
 In Proc. DIMACS Workshop: “The BurrowsWheeler Transform: Ten Years Later
, 2004
"... The FMindex is a succinct text index needing only O(Hkn) bits of space, where n is the text size and Hk is the kth order entropy of the text. FMindex assumes constant alphabet; it uses exponential space in the alphabet size, σ. In this paper we show how the same ideas can be used to obtain an inde ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The FMindex is a succinct text index needing only O(Hkn) bits of space, where n is the text size and Hk is the kth order entropy of the text. FMindex assumes constant alphabet; it uses exponential space in the alphabet size, σ. In this paper we show how the same ideas can be used to obtain an index needing O(Hkn) bits of space, with the constant factor depending only logarithmically on σ. Our space complexity becomes better as soon as σ log σ>log n, which means in practice for all but very small alphabets, even with huge texts. We retain the same search complexity of the FMindex. FMindex The FMindex [3] is based on the BurrowsWheeler transform (BWT) [1], which produces a permutation of the original text, denoted by T bwt = bwt(T). String T bwt is a result of the following forward transformation: (1) Append to the end of T a special end marker $, which is lexicographically smaller than any other character; (2) form a conceptual matrix M whose rows are the cyclic shifts of the string T $, sorted in lexicographic order; (3) construct the transformed text L by taking the last column of M. The first column is denoted by F.
Matching for RunLength Encoded Strings
, 1999
"... this paper, we develop significantly faster algorithms for a special class of strings which emerge frequently in pattern matching problems. A string S is runlength encoded if it is described as an ordered sequence of pairs (oe; i), each consisting of an alphabet symbol oe and an integer i. Each pai ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
this paper, we develop significantly faster algorithms for a special class of strings which emerge frequently in pattern matching problems. A string S is runlength encoded if it is described as an ordered sequence of pairs (oe; i), each consisting of an alphabet symbol oe and an integer i. Each
THE SBCTREE: AN INDEX FOR RUNLENGTH COMPRESSED SEQUENCES
, 2005
"... i t, The SBCTree: An Index for RunLength ..."
Matching for RunLength Encoded Strings
, 1997
"... Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, i.s one of the fundamental problems in pattern matching. Tn this paper, we consider the problem of finding the longest common subsequence of two strings. T ..."
Abstract
 Add to MetaCart
. The standard dynamic progr<tTTlming algorithm computes the longest common subsequence of strings X and Y in O(IXI. IYI) time. Here, we develop significantly faster algorithms for a special class of strings which emerge frequently in pattern matching problems. 1 \ string is runlength encollcr
Runlength Encoding for Volumetric Texture
 The 4th IASTED International Conference on Visualization, Imaging, and Image Processing
, 2004
"... With the dramatic increase of 3D imaging techniques, there is a great demand for new approaches in texture analysis of volumetric data. In this paper, we present a new approach for volumetric texture analysis using a runlength encoding matrix and its texture descriptors. We experiment with our appro ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
approach on the volumetric data generated from two normal Computed Tomography (CT) studies of the chest and abdomen. Our preliminary results show that there are runlength features calculated from the volumetric runlength matrix that are capable of capturing the texture primitives ’ properties
On the Capacity of TwoDimensional RunLength Constrained Channels
 IEEE TRANS. INFORM. THEORY
, 1999
"... Twodimensional binary patterns that satisfy onedimensional (d; k) runlength constraints both horizontally and vertically are considered. For a given d and k, the capacity C d; k is defined as C d; k =lim m;n!1 log 2 N m;n =mn, where N m;n denotes the number of m 2 n rectangular patterns that s ..."
Abstract

Cited by 63 (11 self)
 Add to MetaCart
Twodimensional binary patterns that satisfy onedimensional (d; k) runlength constraints both horizontally and vertically are considered. For a given d and k, the capacity C d; k is defined as C d; k =lim m;n!1 log 2 N m;n =mn, where N m;n denotes the number of m 2 n rectangular patterns
Texture information in run length matrices
 IEEE Transactions on Image Processing
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Random test run length and effectiveness
 In Automated Software Engineering
, 2008
"... Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear whether executing a small number of long runs or a large number of short runs maximizes utility. It is generally expected that ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
Abstract—A poorly understood but important factor in random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear whether executing a small number of long runs or a large number of short runs maximizes utility. It is generally expected
Results 1  10
of
743,142