Lempel–Ziv Data Compression on Parallel and Distributed Systems

We present a survey of results concerning Lempel–Ziv data compression on parallel and distributed systems, starting from the theoretical approach to parallel time complexity to conclude with the practical goal of designing distributed algorithms with low communication cost. Storer’s extension for im...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithms Ročník 4; číslo 3; s. 183 - 199
Hlavný autor:	De Agostino, Sergio
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.09.2011
Predmet:	binary image dictionary-based compression parallel complexity; distributed algorithm string factorization
ISSN:	1999-4893, 1999-4893
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	We present a survey of results concerning Lempel–Ziv data compression on parallel and distributed systems, starting from the theoretical approach to parallel time complexity to conclude with the practical goal of designing distributed algorithms with low communication cost. Storer’s extension for image compression is also discussed.
Bibliografia:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	1999-4893 1999-4893
DOI:	10.3390/a4030183