{"id":"W2012368965","doi":"10.1145/1837210.1837238","title":"Cache friendly sparse matrix-vector multiplication","year":2010,"lang":"en","type":"article","venue":"","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; Western University","funders":"","keywords":"Computer science; Multiplication (music); Parallel computing; Matrix multiplication; Cache-oblivious algorithm; Locality; Cache; Kernel (algebra); Context (archaeology); Cache algorithms; Conjugate gradient method; Sparse matrix; Algorithm; Theoretical computer science; CPU cache; Mathematics; 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.0005044835,0.0005461237,0.000919753,0.0005013623,0.0006307299,0.001004563,0.001585996,0.000858285,0.01053348],"category_scores_gemma":[0.004268431,0.0002802297,0.0003221142,0.001280199,0.0003657312,0.00167612,0.00140205,0.000897489,0.005510419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003449035,"about_ca_system_score_gemma":0.001086611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001928973,"about_ca_topic_score_gemma":0.003949897,"domain_scores_codex":[0.9993218,0.0001452879,0.00004171827,0.00009031227,0.0003298977,0.00007105958],"domain_scores_gemma":[0.9983671,0.0004436018,0.0001024558,0.0004951986,0.0005298276,0.00006180572],"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.0005408801,0.0001974894,0.002189197,0.0005304731,0.0001294424,0.0005483548,0.0002969756,0.2317123,0.02653401,0.1570316,0.08122279,0.4990664],"study_design_scores_gemma":[0.00003847979,0.00006144446,0.0002255984,0.00002308976,0.00001144602,0.0001606971,0.00002784684,0.9250229,0.008327226,0.04409603,0.02198804,0.00001724415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01850248,0.0009086789,0.958702,0.0004589449,0.0001817905,0.00006459097,0.0004724002,0.005767949,0.0149412],"genre_scores_gemma":[0.4115438,0.0008821674,0.5665254,0.000302344,0.0002362023,0.0003205216,0.001535843,0.0007370521,0.01791668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01053348,"threshold_uncertainty_score":0.03523803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01219378125737502,"score_gpt":0.2626093437592976,"score_spread":0.2504155625019226,"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."}}