{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000408884,0.0004522275,0.0003465113,0.0005864889,0.0001753497,0.0003995666,0.0006096933,0.0002845456,0.001828324],"category_scores_gemma":[0.001719889,0.0001972177,0.0002691094,0.0005340081,0.0002246771,0.0004585389,0.0003673298,0.0004209761,0.0005013644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002626292,"about_ca_system_score_gemma":0.000835536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001218007,"about_ca_topic_score_gemma":0.002577677,"domain_scores_codex":[0.999499,0.0001314899,0.00003739416,0.00003833278,0.0002621061,0.0000317132],"domain_scores_gemma":[0.9994569,0.000230853,0.00004560572,0.00008288127,0.0001650194,0.00001863167],"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.0004520366,0.0001507285,0.001598562,0.0001637787,0.00004902319,0.0001799951,0.0001585126,0.1055565,0.1417814,0.02005238,0.001945683,0.7279115],"study_design_scores_gemma":[0.00005802766,0.0003108307,0.0007226788,0.00002060579,0.00002686466,0.000405082,0.0000254785,0.9453963,0.04241211,0.003462471,0.007137742,0.00002192675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02319464,0.0001748245,0.9747511,0.00004070565,0.00001716126,0.00005796385,0.00001653372,0.0003219067,0.001425222],"genre_scores_gemma":[0.19158,0.0001668029,0.8062726,0.0000400027,0.00001984601,0.0000765076,0.00009871008,0.00009804285,0.001647543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001828324,"threshold_uncertainty_score":0.006116331,"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."}}