We use a multilevel dominant eigenvector estimation algorithm to develop a new run-length texture feature extraction algorithm that preserves much of the texture information in run-length matrices and significantly improves image classification accuracy over traditional run-length techniques. The advantage of this approach is demonstrated experimentally by the classification of two texture data...

Simulation of large scale networks can be very time and resource-consuming. It is hard to predict when the amount of data collected from a simulation is enough and the measurement is accurate enough for the parameter of interest. In this paper, we study the planning of simulation run length, and investigate how many cycles of overflow / non-overflow are needed for the packet loss probability to...

In this report, we present a series of improvements to the basic run-length encoding algorithm. Several modified algorithms are generated, from basic CPU single-threaded compression to a highly parallelized version on NVidia CUDA hardware. We also investigated changes to memory access locality in the parallel versions. With a comparison of the various compression times and their corresponding d...

1 Motivation Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, is one of the fundamental problems in pattern matching. We consider the problem of nding the longest common subsequence of two strings. A well-known dynamic programming algorithm computes the longest common subsequence of strings X and Y i...

We introduce a novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows an...

This paper presents a new pattern run-length compression method whose decompressor is simple and easy to implement. It encodes 2|n| runs of compatible or inversely compatible patterns, either inside a single test data segment or across multiple test data segments. Experimental results show that it can achieve an average compression ratio of 67.64% and considerable test application time savings.

This chapter presents a new encoding scheme called alternating frequency-directed equal-run-length (AFDER) coding for test data compression. This encoding scheme together with nine-coded compression technique enhance the test data compression ratio. In the first stage, the pre-generated test cubes with unspecified bits are encoded using nine-coded compression scheme. Later, the proposed encodin...

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.  2002 Elsevier Science B.V. All rights reserved.

In these notes we describe how to measure the confidence we have in our Monte-Carlo estimates. In particular, we use he Central Limit Theorem to construct confidence intervals for the quantity we are truing to estimate. We also describe methods to estimate the number of samples that are required to achieve a given confidence level.

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 approach on the volumetric data generated from two normal Computed Tomography (CT) studies of the ches...