Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 24 for “"text compression"”.
-
Efficient Parallel Text Compression on GPUs
This paper demonstrates an efficient text compressor with parallel Lempel-Ziv-Markov chain algorithm (LZMA) on graphics processing units (GPUs). We divide LZMA into two parts, match finder and range encoder. We parallel both parts and achieve competitive performance with freeArc on AMD 6-core 2.81 …
-
Hybrid dictionary/statistical text compression algorithms
… algorithms for compressing textual information. The specific intent was to attempt to find an algorithm which would yield greater compression on text files than the algorithm PPMC without requiring significantly greater computing resources; PPMC is widely regarded as the …
-
Text compression implementation using an incrementor decompressor
This thesis describes a test pattern compression scheme that reduces test time by using specific on-chip decompression hardware for updating the test vector. Using the proposed hardware to update the test vector improves the bottleneck of data throughput between the tester and the device under test …
-
A Plain-text Compression Technique with Fast Lookup Ability
Data compression has always been an essential aspect of computing. In recent times, with the increasing popularity of remote and cloud-based computation, compression is becoming more important. Reducing the size of a data object in this context would not only reduce the transfer time, but also the …
-
Transform Based And Search Aware Text Compression Schemes And Compressed Domain Text Retrieval
… we have witnessed an unprecedented growth of textual information via the Internet, digital libraries and archival text in many applications. While a good fraction of this information is of transient interest, useful information of archival value will continue to accumulate. We need ways to …
-
Permutation techniques in lossless compression
… have been analyzed and used for dictionary and text compression. However, they have never been investigated or taken as a method for image compression. The topic of this dissertation was to investigate the use of permutation techniques primarily for image and secondarily for text compression. …
-
Algorithms and Lower Bounds for Ordering Problems on Strings
… lower bounds for a collection of string and text-compression-related problems. These results are unified under the theme of ordering constraint satisfaction. Utilizing the connections to ordering constraint satisfaction, we provide hardness results and algorithms for the following: …
-
Indexing Compressed Text
… rapid growth of the volume of electronic data, text compression and indexing techniques are receiving more and more attention. These two issues are usually treated as independent problems, but approaches of combining them have recently attracted the attention of researchers. In this thesis, we …
-
Lossless compression using binary necklace classes and multiple huffman trees
In this thesis, we present two lossless compression approaches. Our Rotational Tree Approach (RTA) is based upon mathematics developed by Fredricksen. RTA uses the rotations associated with binary necklace classes to disperse source bit strings to a forest of Huffinan encoding trees. Our Indexed …
-
Compression versus Machine Learning for Classifying Modern Arabic Code-Switching in Social Media and Classical Arabic Hadith
… the prediction by partial matching (PPM) compression approach, comparing it with a the support vector machine (SVM) classifier with character-based and wordbased approaches. The aim was to test the PPM compression on modern standard Arabic (MSA) and Arabic dialect before using it on …
-
Sequentialized Language Models
… grammatical model of linguistic objects in text compression. We develop the Prediction by Grammatical Match technique, a new compression framework employing a static context-free grammar and an adaptive finite-context statistical model. These compressors are adaptive, general compressors …
-
Breaking Language Barriers: Reimagining Machine Translation as Style Transfer
… analysis to better capture linguistic and contextual nuances in translation evaluation and can estimate the quality of machine-generated sentences in more than 200 different languages. Furthermore, Embed_llama leverages pre-trained Large Language Model (LLM) embeddings to enhance semantic …
-
Prediction by Partial Matching for Identification of Biological Entities
… what is “useful”, we can potentially utilize text mining for our purpose. In a novel attempt to beat the challenge, we have put information theory and text compression through this task. Prediction by partial matching is an adaptive text encoding scheme that blends together a set of finite …
-
Avoiding Redundancies in Words
… are also of main<br/>concerns in the domains of text compression and of pattern matching. The knowledge of extreme situations or strongest constraints on words help analyse the behaviour of the corresponding algorithms.<br/><br/>In this document, we provide a new proof for the Fraenkel and …
-
Wiswesser line notation in modern cheminformatics; Implementations for parsing, conversion and compression of chemical entities
… data storage, particularly in terms of data compression. Lossless text compression techniques, adapted and optimised for chemical data, will soon be required in order for researchers to handle large-scale curated sources. A novel approach could involve examining a chemical notation system …
-
Empirical analysis of BWT-based lossless image compression
The Burrows-Wheeler Transformation (BWT) is a text transformation algorithm originally designed to improve the coherence in text data. This coherence can be exploited by compression algorithms such as run-length encoding or arithmetic coding. However, there is still a debate on its performance on …
-
Lossless compression and neuron structure extraction for fluorescence microscopy confocal neuron images
… neuron images.;The first problem is on lossless compression of neuron images. We consider context based modeling methods, which are seen an important step in high performance lossless data compression. We study methods for effective context modeling for images based on existing successful …
-
Semantic Based Content Search and Content Summarization
… consider document summarization as a problem of text compression. One of the most complete definitions by Sparck-Jones states that "...a summary is a reductive transformation of source text to summary text through content condensation by selection and/or generalisation on what is important in the …
-
Compressed Pattern Matching For Text And Images
… at an ever-increasing rate. On one hand, data compression is needed to efficiently store, organize the data and transport the data over the limited-bandwidth network. On the other hand, efficient information retrieval is needed to speedily find the relevant information from this huge mass of …
-
Algorithms and Combinatorics of Repetitions in Strings
… with exactly essential applications to text algorithms, data compression, and also analysis of biological sequences. It is relevant to periodicities, regularities, and compression. The higher compression rate can be obtained from the repetitive behavior of strings, and reversely some …
Page 1 of 2