• 沒有找到結果。

Error Resilient Lempel-Ziv Data Compression Scheme with Perfect Hashing

N/A
N/A
Protected

Academic year: 2022

Share "Error Resilient Lempel-Ziv Data Compression Scheme with Perfect Hashing"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: Error Resilient Lempel-Ziv Data Compression Scheme with Perfect Hashing 作者: Chang, C. C.;Tseng, S. W.

關鍵詞: Lempel-Ziv code;Error resilient;k-error protocol;Perfect hashing 日期: 2008-03

上傳時間: 2009-12-17T06:57:50Z 出版者: Asia University

摘要: Storer and Reif have studied the error resilient Lempel-Ziv code and shown that it gives protection against error propagation. They left an open problem in the error resilient Lempel-Ziv algorithm with k-error protocol. The algorithm uses hash function to eliminate the dependence between addresses in the dictionary. But hash conflicts affect the compression performance. In this paper, we have

implemented a k-error protocol Lempel-Ziv algorithm with perfect hashing. By using a simple perfect hashing scheme, the hash conflicts can be easily removed and the compression performance can be improved. Experimental results also show that our algorithm can enhance the compression performance of the error resilient Lempel-Ziv code.

參考文獻

相關文件

1 After computing if D is linear separable, we shall know w ∗ and then there is no need to use PLA.. Noise and Error Algorithmic Error Measure. Choice of

„ Signaling over standard IP uses a common transport protocol that ensures reliable signaling delivery. „ Error-free

• cost-sensitive classifier: low cost but high error rate. • traditional classifier: low error rate but

Convex optimization, compressed sensing, ℓ 1 -regularization, nuclear/trace norm, regression, variable selection, sensor network localization, approximation accuracy, proximal

2‐c. 若 , 則將DEPQ中B拿出丟到右邊 (或者將DEPQ 中S拿出丟到左邊), 並將A放入DEPQ.

• Delta hedge is based on the first-order approximation to changes in the derivative price, ∆f , due to changes in the stock price, ∆S.. • When ∆S is not small, the

In this report, formats were specified for single, double, and extended precisions, and these standards are generally followed by microcomputer manufactures using

An algorithm is called stable if it satisfies the property that small changes in the initial data produce correspondingly small changes in the final results. (初始資料的微小變動