✦ LIBER ✦

Document Recommendation Using Data Compression

✍ Scribed by Takafumi Suzuki; Shin Hasegawa; Takayuki Hamamoto; Akiko Aizawa

Book ID: 113888546
Publisher: Elsevier
Year: 2011
Tongue: English
Weight: 374 KB
Volume: 27
Category: Article
ISSN: 1877-0428
DOI: 10.1016/j.sbspro.2011.10.593

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-document and multi-document summa

Single-document and multi-document summarization techniques for email threads using sentence compression

✍ David M. Zajic; Bonnie J. Dorr; Jimmy Lin 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Data compression using hierarchical dict

Data compression using hierarchical dictionaries

✍ Daniel K. Chang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 775 KB

Fast Exponentiation Using Data Compressi

Fast Exponentiation Using Data Compression

✍ Yacobi, Yacov 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 213 KB

Vacuum Assisted Closure: Recommendations

Vacuum Assisted Closure: Recommendations for Use : A Consensus Document

📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB

Data compression using straight line int

Data compression using straight line interpolation

✍ Davisson, L. 📂 Article 📅 1968 🏛 IEEE 🌐 English ⚖ 701 KB

Data compression using the deconvolution

Data compression using the deconvolution algorithm CLEAN

✍ Nathan Cohen; Guido Sandri 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 396 KB

We describe an application of the nonlinear deconvolution algorithm CLEAN in which a priori knowledge of the point-spread function allows transmission of nonredundant information. We refer to this as CLEAN compression. The point-spread function is viewed as a redundancy function. The data set may be