{"id":"W2146369775","doi":"10.1109/icc.2009.40","title":"A Note on the Performance of Sparse Matrix-vector Multiplication with Column Reordering","year":2009,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Row and column spaces; Sparse matrix; Row; Computer science; Column (typography); Multiplication (music); Parallel computing; Preprocessor; Binary number; Matrix multiplication; Matrix (chemical analysis); Algorithm; Reuse; Supercomputer; Theoretical computer science; Arithmetic; Mathematics; Artificial intelligence","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.001389476,0.0008062226,0.0006623612,0.0007118962,0.0005743284,0.0009637562,0.0009280568,0.0005445895,0.003792423],"category_scores_gemma":[0.009108475,0.0002613074,0.0002753917,0.001924723,0.0006640716,0.002194962,0.0006845666,0.001078033,0.001409315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000427663,"about_ca_system_score_gemma":0.0007349842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002374625,"about_ca_topic_score_gemma":0.002955368,"domain_scores_codex":[0.9986956,0.0004470292,0.00008249061,0.0001127916,0.0005217984,0.0001403155],"domain_scores_gemma":[0.9924063,0.004180592,0.0002850577,0.001897175,0.001113002,0.0001178296],"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.001693768,0.0002220222,0.002995512,0.0004866886,0.00009206113,0.0003896366,0.0002965414,0.0794891,0.1221764,0.03482038,0.0196586,0.7376793],"study_design_scores_gemma":[0.0001546006,0.001350613,0.002636704,0.00008391782,0.00007709484,0.000962424,0.0001543544,0.683525,0.2538874,0.02752532,0.02954675,0.00009587884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1788254,0.007212174,0.7797573,0.002584379,0.0007667437,0.0001092989,0.0002010406,0.0084509,0.0220928],"genre_scores_gemma":[0.5206894,0.002004068,0.4682056,0.0003258635,0.00031148,0.00006704427,0.0004866495,0.0005491593,0.007360719],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003792423,"threshold_uncertainty_score":0.01268697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01072858398523838,"score_gpt":0.2337511688409588,"score_spread":0.2230225848557204,"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."}}