{"id":"W2944913135","doi":"10.1155/2019/3185137","title":"Low-Complexity Scalable Architectures for Parallel Computation of Similarity Measures","year":2019,"lang":"en","type":"article","venue":"Scientific Programming","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Computation; Flexibility (engineering); Scheduling (production processes); Curse of dimensionality; Parallel computing; Similarity (geometry); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Mathematical optimization","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.001088132,0.0001380673,0.0002170839,0.0001515326,0.0003255727,0.0004552007,0.0008830997,0.00005419906,0.000006212],"category_scores_gemma":[0.00006824188,0.000117113,0.0001093574,0.0004982124,0.000201521,0.0002391988,0.0003421331,0.000104469,0.00001543411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000238724,"about_ca_system_score_gemma":0.00009443994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000370829,"about_ca_topic_score_gemma":0.00001984165,"domain_scores_codex":[0.9981077,0.00005746947,0.0003021032,0.0006211526,0.0005242379,0.0003873898],"domain_scores_gemma":[0.9987593,0.00008551114,0.0001815172,0.0006168043,0.0002641659,0.00009271088],"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.0000385255,0.0003289071,0.001525423,0.0003416998,0.00002042619,0.000001215149,0.0008305719,0.006438335,0.005293707,0.01313608,0.0008832206,0.9711619],"study_design_scores_gemma":[0.001174332,0.0002310856,0.003311946,0.0002079028,0.00001325808,0.000006792779,0.00007714309,0.8906741,0.01729062,0.06766469,0.01890292,0.0004451789],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1292115,0.0001464197,0.8685824,0.00009648049,0.0009825006,0.0007273758,0.00001700055,0.000135098,0.0001012434],"genre_scores_gemma":[0.6069098,2.951926e-7,0.3928977,0.00001741045,0.00002486968,0.00002221769,0.00002711262,0.000005838486,0.00009482255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9707167,"threshold_uncertainty_score":0.4775728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03955990859306042,"score_gpt":0.2835737805798486,"score_spread":0.2440138719867882,"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."}}