{"id":"W2153447124","doi":"","title":"Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Prefix; Prefix code; Alphabet; Encoding (memory); Algorithm; Time complexity; Integer (computer science); Function (biology); Generalization; Binary logarithm; Binary number; Mathematics; Computer science; Discrete mathematics; Property (philosophy); Computational complexity theory; Combinatorics; Arithmetic; Block code; Decoding methods; Linear code","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120147,0.0009059065,0.001161263,0.001242942,0.0005304536,0.00108168,0.001035494,0.0013157,0.003426339],"category_scores_gemma":[0.006060436,0.0005060201,0.0008315032,0.00156557,0.0006359169,0.001707594,0.001369911,0.001194975,0.00135793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000612599,"about_ca_system_score_gemma":0.001840598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006543317,"about_ca_topic_score_gemma":0.0008451263,"domain_scores_codex":[0.9986582,0.0003331569,0.000132838,0.0002161139,0.0005268466,0.0001328545],"domain_scores_gemma":[0.9970326,0.00171244,0.0002726958,0.0005254671,0.0003819913,0.00007478032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003543816,0.000215957,0.0007312241,0.0005368197,0.0001046611,0.0002400027,0.0003331621,0.1990332,0.03864504,0.08496503,0.00555465,0.6692858],"study_design_scores_gemma":[0.0002287089,0.000308329,0.0002394612,0.00006236789,0.00005399839,0.0004533678,0.00007485368,0.881032,0.02936158,0.07846546,0.009662862,0.00005691114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01035095,0.0001644096,0.9875294,0.0001258842,0.00003776303,0.00007667553,0.00005598649,0.0004435881,0.001215358],"genre_scores_gemma":[0.07711925,0.000204472,0.920535,0.0001012394,0.00005210464,0.0002966256,0.0002550064,0.00009759508,0.001338744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003426339,"threshold_uncertainty_score":0.01146227,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01264968380471236,"score_gpt":0.2293029668300164,"score_spread":0.2166532830253041,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}