{"id":"W2168664118","doi":"10.1109/pacrim.1995.519458","title":"Efficient modular interconnection networks for digital filtering and convolution","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interconnection; Convolution (computer science); Adder; Very-large-scale integration; Computer science; Modular design; Topology (electrical circuits); Simple (philosophy); Parallel computing; Factorization; Tensor product; Algorithm; Mathematics; Embedded system; Artificial intelligence; Latency (audio)","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.000260981,0.0003966111,0.0002162791,0.0004273702,0.0003080801,0.0003650606,0.0004427746,0.0003515804,0.002048431],"category_scores_gemma":[0.0007452549,0.0001690922,0.0002655068,0.0005730795,0.0002957958,0.000863533,0.0003692787,0.0003304361,0.0004312317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005492726,"about_ca_system_score_gemma":0.0003340282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005589763,"about_ca_topic_score_gemma":0.001414098,"domain_scores_codex":[0.9998702,0.00003105978,0.000008411575,0.00002450591,0.00004539256,0.00002032312],"domain_scores_gemma":[0.9998536,0.00005340587,0.0000251171,0.00002900359,0.0000312532,0.000007560649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002163781,0.00005831494,0.0005949587,0.0003042993,0.00006002507,0.0002329604,0.0001474713,0.2600149,0.1087661,0.2082253,0.005303877,0.4160755],"study_design_scores_gemma":[0.00003361105,0.0001631297,0.0003569901,0.00002875092,0.0000404499,0.0001908674,0.00001956731,0.8783658,0.03239532,0.06682293,0.02155982,0.00002284944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05291877,0.001012062,0.939145,0.000235437,0.00008082556,0.00003446752,0.00006771984,0.0007343054,0.005771453],"genre_scores_gemma":[0.5768675,0.001182251,0.4153315,0.0001053876,0.00008664215,0.00009278431,0.0002269826,0.000112007,0.005995117],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002048431,"threshold_uncertainty_score":0.006852686,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01702856552964732,"score_gpt":0.2178239349034043,"score_spread":0.200795369373757,"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."}}