{"id":"W2039351044","doi":"10.1109/tmm.2007.906557","title":"Efficient Algorithms for Optimal Uneven Protection of Single and Multiple Scalable Code Streams Against Packet Erasures","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Erasure; Scalability; Algorithm; Network packet; Set partitioning in hierarchical trees; Code (set theory); Transmission (telecommunications); Binary erasure channel; Code rate; Decoding methods; Computer network; Channel capacity; Image compression; Channel (broadcasting)","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.001261277,0.0007858913,0.0009261466,0.0007116853,0.0003852665,0.0008215514,0.001049056,0.0007236997,0.00164386],"category_scores_gemma":[0.005031977,0.0003669807,0.0005389589,0.0006665384,0.0008703251,0.001376204,0.001504146,0.001201209,0.0003466785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007295242,"about_ca_system_score_gemma":0.001262327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001300974,"about_ca_topic_score_gemma":0.001244994,"domain_scores_codex":[0.9995102,0.0001159727,0.00002833885,0.00007658876,0.0001923632,0.00007664086],"domain_scores_gemma":[0.9985103,0.0009212265,0.0001511859,0.0001822741,0.0001828823,0.00005212672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000101792,0.00004221344,0.0004046643,0.00006979853,0.00003083351,0.00005392373,0.0001244061,0.8310264,0.005203508,0.04061252,0.001011823,0.1213181],"study_design_scores_gemma":[0.00001331745,0.0000237033,0.00003146961,0.000004599185,0.000003241141,0.00001580607,0.0000130017,0.9894128,0.001548481,0.008617646,0.0003118509,0.00000405731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007957832,0.00006442611,0.9911942,0.00004684525,0.00001001815,0.00002541623,0.00001090706,0.0001270534,0.0005634231],"genre_scores_gemma":[0.2841222,0.0002244437,0.7134954,0.0000586216,0.00004348413,0.0002069513,0.0001112144,0.0001089019,0.00162873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00164386,"threshold_uncertainty_score":0.006670356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03320495448483631,"score_gpt":0.2834498373875809,"score_spread":0.2502448829027446,"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."}}