Yüklüyor......
Lossless Compression of Binary Trees with Correlated Vertex Names
Compression schemes for advanced data structures have become a central modern challenge. Information theory has traditionally dealt with conventional data such as text, images, or video. In contrast, most data available today is multitype and context-dependent. To meet this challenge, we have recent...
Kaydedildi:
| Yayımlandı: | IEEE Trans Inf Theory |
|---|---|
| Asıl Yazarlar: | , , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
2018
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6752213/ https://ncbi.nlm.nih.gov/pubmed/31537945 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/TIT.2018.2851224 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|