Načítá se...
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...
Uloženo v:
| Vydáno v: | IEEE Trans Inf Theory |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2018
|
| Témata: | |
| On-line přístup: | 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 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|