Academic literature on the topic 'Parallel Lempel-Ziv'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parallel Lempel-Ziv.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Parallel Lempel-Ziv"

1

Klein, Shmuel Tomi, and Yair Wiseman. "Parallel Lempel Ziv coding." Discrete Applied Mathematics 146, no. 2 (2005): 180–91. http://dx.doi.org/10.1016/j.dam.2004.04.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Han, Ling Bo, Bin Lao, and Ge Nong. "Succinct parallel Lempel–Ziv factorization on a multicore computer." Journal of Supercomputing 78, no. 5 (2021): 7278–303. http://dx.doi.org/10.1007/s11227-021-04165-w.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

De Agostino, Sergio. "Lempel–Ziv Data Compression on Parallel and Distributed Systems." Algorithms 4, no. 3 (2011): 183–99. http://dx.doi.org/10.3390/a4030183.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fujioka, Toyota, and Hirotomo Aso. "Parallel architecture for high-speed Lempel-Ziv data coding/decoding." Systems and Computers in Japan 29, no. 8 (1998): 28–37. http://dx.doi.org/10.1002/(sici)1520-684x(199807)29:8<28::aid-scj4>3.0.co;2-m.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

King, G. R. Gnana, C. Christopher Seldev, and N. Albert Singh. "A Novel Compression Technique for Compound Images Using Parallel Lempel-Ziv-Welch Algorithm." Applied Mechanics and Materials 626 (August 2014): 44–51. http://dx.doi.org/10.4028/www.scientific.net/amm.626.44.

Full text
Abstract:
Compound image is a combination of natural images, text, and graphics.This paper presents a compression technique for improving coding efficiency. The algorithm first decomposes the compound images by using 3 level biorthogonal wavelet transform and then the transformed image was further compressed by Parallel dictionary based LZW algorithm called PDLZW.In PDLZW algorithm instead of using a unique fixed word width dictionary a hierarchical variable word width dictionary set containing several dictionaries of small address space and increases the word widths used for compression and decompressi
APA, Harvard, Vancouver, ISO, and other styles
6

Ji, Guoli, Yong Zeng, Zijiang Yang, Congting Ye, and Jingci Yao. "A multiple sequence alignment method with sequence vectorization." Engineering Computations 31, no. 2 (2014): 283–96. http://dx.doi.org/10.1108/ec-01-2013-0026.

Full text
Abstract:
Purpose – The time complexity of most multiple sequence alignment algorithm is O(N2) or O(N3) (N is the number of sequences). In addition, with the development of biotechnology, the amount of biological sequences grows significantly. The traditional methods have some difficulties in handling large-scale sequence. The proposed Lemk_MSA method aims to reduce the time complexity, especially for large-scale sequences. At the same time, it can keep similar accuracy level compared to the traditional methods. Design/methodology/approach – LemK_MSA converts multiple sequence alignment into correspondi
APA, Harvard, Vancouver, ISO, and other styles
7

FRANEK, FRANTISEK, and MEI JIANG. "CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS." International Journal of Foundations of Computer Science 23, no. 02 (2012): 389–401. http://dx.doi.org/10.1142/s0129054112400199.

Full text
Abstract:
Crochemore's repetitions algorithm introduced in 1981 was the first O(n log n) algorithm for computing repetitions. Since then, several linear-time worst-case algorithms for computing runs have been introduced. They all follow a similar strategy: first compute the suffix tree or array, then use the suffix tree or array to compute the Lempel-Ziv factorization, then using the Lempel-Ziv factorization compute all the runs. It is conceivable that in practice an extension of Crochemore's repetitions algorithm may outperform the linear-time algorithms, or at least for certain classes of strings. The
APA, Harvard, Vancouver, ISO, and other styles
8

Di, Jinhong, Pengkun Yang, Chunyan Wang, and Lichao Yan. "Layered Lossless Compression Method of Massive Fault Recording Data." International Journal of Circuits, Systems and Signal Processing 16 (January 3, 2022): 17–25. http://dx.doi.org/10.46300/9106.2022.16.3.

Full text
Abstract:
In order to overcome the problems of large error and low precision in traditional power fault record data compression, a new layered lossless compression method for massive fault record data is proposed in this paper. The algorithm applies LZW (Lempel Ziv Welch) algorithm, analyzes the LZW algorithm and existing problems, and improves the LZW algorithm. Use the index value of the dictionary to replace the input string sequence, and dynamically add unknown strings to the dictionary. The parallel search method is to divide the dictionary into several small dictionaries with different bit widths
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Parallel Lempel-Ziv"

1

Mathur, Milind. "ANALYSIS OF PARALLEL LEMPEL-ZIV COMPRESSION USING CUDA." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14425.

Full text
Abstract:
Data compression is a topic that has been researched upon for years and we have standard formats like zip, rar, gzip, bz2 in generic data; jpeg, gif in images; . In this age where we have lots of data with internet being ubiquitous, there is a strong need for fast and efficient data compression algorithm. Lempel-Ziv family of compression algorithms form the basis for a lot of commonly used formats. Some modified form of LZ77 algorithm is still used widely as a lossless run length encoding algorithm. Recently Graphics Processing Units (GPUs) are making headway into the scientific computin
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Parallel Lempel-Ziv"

1

Tomi Klein, Shmuel, and Yair Wiseman. "Parallel Lempel Ziv Coding (Extended Abstract)." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48194-x_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parallel Lempel-Ziv"

1

Julian Shun and Fuyao Zhao. "Practical Parallel Lempel-Ziv Factorization." In 2013 Data Compression Conference (DCC). IEEE, 2013. http://dx.doi.org/10.1109/dcc.2013.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

King, G. R. G., C. S. Christopher, and N. A. Singh. "Compound image compression using parallel Lempel-Ziv-Welch algorithm." In IET Chennai Fourth International Conference on Sustainable Energy and Intelligent Systems (SEISCON 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/ic.2013.0364.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

De Agostino, Sergio. "Lempel-Ziv Data Compression on Parallel and Distributed Systems." In 2011 First International Conference on Data Compression, Communications and Processing (CCP). IEEE, 2011. http://dx.doi.org/10.1109/ccp.2011.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Shukla, Sankalp, Maniram Ahirwar, Ritu Gupta, Sarthak Jain, and Dheeraj Singh Rajput. "Audio Compression Algorithm using Discrete Cosine Transform (DCT) and Lempel-Ziv-Welch (LZW) Encoding Method." In 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon). IEEE, 2019. http://dx.doi.org/10.1109/comitcon.2019.8862228.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!