{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001578628,0.0001340381,0.0001366058,0.00009294999,0.0001335323,0.0001064479,0.0007116529,0.00004912599,0.000109262],"category_scores_gemma":[0.00009674344,0.0001110186,0.00005461117,0.0002872193,0.00002356465,0.0002462338,0.0002235378,0.00006035589,0.00008794424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003698077,"about_ca_system_score_gemma":0.000008230462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000444948,"about_ca_topic_score_gemma":8.06312e-7,"domain_scores_codex":[0.9988404,0.00004413653,0.0002292754,0.000426525,0.0001885788,0.0002711148],"domain_scores_gemma":[0.9989201,0.0001454881,0.00009504082,0.0006453499,0.0001160355,0.00007798651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000161555,0.0005057795,0.00003623692,0.00004145811,0.00002222394,0.000009411051,0.0004221093,0.007773106,0.06843812,0.6670017,0.07337941,0.1823543],"study_design_scores_gemma":[0.0002488253,0.00006812958,0.00004663287,0.00001153337,0.000002056057,0.000002288405,0.000003280033,0.8958356,0.08631441,0.001933873,0.01538309,0.0001502717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004526595,0.00007121072,0.9967482,0.0006434665,0.0002875317,0.0004172266,0.00001467895,0.0009197785,0.0004452574],"genre_scores_gemma":[0.1083964,0.00001964364,0.8898596,0.0004145462,0.0000648174,0.0001035134,0.00001442647,0.00001506599,0.00111202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8880625,"threshold_uncertainty_score":0.4527206,"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."}}