{"id":"W2296433295","doi":"10.1109/icip.2015.7350789","title":"An adaptive search ordering for rate-constrained successive elimination algorithms","year":2015,"lang":"en","type":"article","venue":"","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; Université Laval","keywords":"Computer science; Algorithm; Block (permutation group theory); Matching (statistics); Reference software; Function (biology); Distortion (music); Spiral (railway); Distortion function; Software; Search algorithm; Mathematical optimization; Mathematics; Decoding methods; Statistics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004681585,0.000103371,0.0001140073,0.0001386755,0.0001291194,0.0001904631,0.0008610691,0.00007030844,0.000003846344],"category_scores_gemma":[0.0001597447,0.00008388361,0.00002988678,0.0002759744,0.00005309506,0.0006967183,0.0001865145,0.00008962185,0.00001088645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003844301,"about_ca_system_score_gemma":0.0001174273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004142883,"about_ca_topic_score_gemma":0.000006299912,"domain_scores_codex":[0.9990441,0.0000553561,0.0001366342,0.000336766,0.000186116,0.0002410747],"domain_scores_gemma":[0.9989548,0.0001492842,0.00004622496,0.0003749644,0.0003752004,0.00009949749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003403671,0.00008156479,0.00003665615,0.000007269476,0.00001391104,0.000007372721,0.000983722,0.001916684,0.003154411,0.269257,0.0008915479,0.7236158],"study_design_scores_gemma":[0.0004936595,0.0005818693,0.00009680057,0.00001447214,0.000002150459,0.000003910049,0.001656204,0.9127598,0.0695068,0.01449999,0.0002245357,0.0001597999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00850239,0.00003026407,0.9875942,0.001533239,0.0001838954,0.0001986592,0.000001855356,0.0008172151,0.001138307],"genre_scores_gemma":[0.795665,0.000001991583,0.2039449,0.00006902585,0.0000290136,0.00004938325,0.000002288781,0.000005096577,0.0002332807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9108431,"threshold_uncertainty_score":0.3420675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0875900671023452,"score_gpt":0.3285892660677701,"score_spread":0.2409991989654249,"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."}}