Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7122881> ?p ?o }
Showing triples 1 to 16 of
16
with 100 triples per page.
- Q7122881 subject Q7216422.
- Q7122881 subject Q7451516.
- Q7122881 abstract "The package-merge algorithm is an O(nL)-time algorithm for finding an optimal length-limited Huffman code for a given distribution on a given alphabet of size n, where no code word is longer than L. It is a greedy algorithm, and a generalization of Huffman's original algorithm. Package-merge works by reducing the code construction problem to the binary coin collector's problem.".
- Q7122881 wikiPageExternalLink AbDfPkMg.pas.
- Q7122881 wikiPageWikiLink Q131476.
- Q7122881 wikiPageWikiLink Q2493.
- Q7122881 wikiPageWikiLink Q2647.
- Q7122881 wikiPageWikiLink Q269878.
- Q7122881 wikiPageWikiLink Q4885542.
- Q7122881 wikiPageWikiLink Q504353.
- Q7122881 wikiPageWikiLink Q631286.
- Q7122881 wikiPageWikiLink Q7216422.
- Q7122881 wikiPageWikiLink Q7451516.
- Q7122881 wikiPageWikiLink Q863873.
- Q7122881 comment "The package-merge algorithm is an O(nL)-time algorithm for finding an optimal length-limited Huffman code for a given distribution on a given alphabet of size n, where no code word is longer than L. It is a greedy algorithm, and a generalization of Huffman's original algorithm. Package-merge works by reducing the code construction problem to the binary coin collector's problem.".
- Q7122881 label "Package-merge algorithm".