{"id":"W4229983139","doi":"10.1109/icc.1994.369052","title":"Efficient algorithms for fixed-rate entropy-coded vector quantization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Algorithm; Cartesian product; Entropy (arrow of time); Linear subspace; Computer science; Dynamic programming; Vector quantization; Theoretical computer science; Source code; Mathematics; Data structure; Discrete mathematics","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.001746277,0.001227167,0.001366087,0.002138659,0.0009403926,0.002851052,0.003245479,0.001456553,0.009261325],"category_scores_gemma":[0.007693248,0.0007254764,0.0009322402,0.002680103,0.001159823,0.003075661,0.002727294,0.002300944,0.003908894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00186971,"about_ca_system_score_gemma":0.00247297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003719672,"about_ca_topic_score_gemma":0.004696673,"domain_scores_codex":[0.997665,0.0004385574,0.0002095141,0.0003327082,0.001103587,0.0002505375],"domain_scores_gemma":[0.9981438,0.0008482619,0.0001367222,0.0002973621,0.000529268,0.00004457372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001810153,0.0000998067,0.0003050284,0.0001917952,0.00004986551,0.0001001284,0.0001993019,0.2066271,0.005792621,0.1860451,0.01000564,0.5904027],"study_design_scores_gemma":[0.00006141534,0.00003963099,0.00008761858,0.00004061231,0.00001197719,0.00007863409,0.0000345433,0.8744972,0.003784127,0.1154596,0.005874035,0.00003057199],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001087733,0.0002552092,0.9956371,0.00009082339,0.00004706147,0.00009476174,0.00007546531,0.0007827057,0.001929159],"genre_scores_gemma":[0.05464173,0.0004707054,0.9394388,0.0001030952,0.0001000207,0.000452996,0.000514916,0.0002321769,0.004045517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009261325,"threshold_uncertainty_score":0.03098226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03449539150962558,"score_gpt":0.2857724173396541,"score_spread":0.2512770258300285,"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."}}