{"id":"W1571317019","doi":"10.1109/iscas.2015.7169256","title":"Massively parallel KD-tree construction and nearest neighbor search algorithms","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Speedup; Computer science; Massively parallel; Parallel computing; k-d tree; Tree (set theory); Graphics processing unit; Parallel algorithm; Optimal binary search tree; CUDA; Algorithm; k-nearest neighbors algorithm; Binary tree; Interval tree; Tree structure; Tree traversal; Artificial intelligence; 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.0004832996,0.0005259349,0.001025599,0.0009534209,0.000969946,0.0009571517,0.00142257,0.0006455173,0.002693384],"category_scores_gemma":[0.001873421,0.0004058074,0.0008022541,0.00176217,0.0004268202,0.001579008,0.001235418,0.0007099231,0.001281371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000602074,"about_ca_system_score_gemma":0.001179281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003778713,"about_ca_topic_score_gemma":0.004122106,"domain_scores_codex":[0.9994605,0.00008111278,0.00005137064,0.0001054741,0.000247262,0.00005430003],"domain_scores_gemma":[0.9994729,0.0001149533,0.00005055646,0.0001256818,0.0002009282,0.00003508987],"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.0002411277,0.0001734585,0.002016156,0.0003823883,0.0001154871,0.0002643064,0.0002141167,0.2585669,0.01345599,0.05091976,0.0141339,0.6595163],"study_design_scores_gemma":[0.00003675867,0.00004031094,0.0003447149,0.00001170016,0.00002076043,0.0001964491,0.00003302746,0.9613838,0.004550682,0.02333305,0.01002949,0.00001920335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007754609,0.0003574014,0.9878137,0.0001229802,0.00007654327,0.00005980602,0.00008084149,0.001343026,0.002391099],"genre_scores_gemma":[0.1063311,0.0004098177,0.8896664,0.00007564625,0.00005449853,0.0001418426,0.0004771842,0.000155727,0.002687906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003778713,"threshold_uncertainty_score":0.009010255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04861505906557487,"score_gpt":0.3025420344989163,"score_spread":0.2539269754333414,"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."}}