Wird geladen...
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...
Gespeichert in:
| Veröffentlicht in: | IEEE Trans Inf Theory |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
2018
|
| Schlagworte: | |
| Online Zugang: | 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 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|