{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000195588,0.0001111235,0.000125006,0.00007871785,0.00007664332,0.0001800031,0.0003164125,0.00005550421,0.000008815649],"category_scores_gemma":[0.00005968261,0.00009116795,0.00002402381,0.0002796284,0.0001267727,0.0009347257,0.0002834287,0.0001278242,0.00003239177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003333595,"about_ca_system_score_gemma":0.00007925504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005250704,"about_ca_topic_score_gemma":0.000004255683,"domain_scores_codex":[0.999015,0.00004079824,0.0001407451,0.0003181011,0.0002562744,0.000229064],"domain_scores_gemma":[0.9992438,0.00004710694,0.00003719496,0.0002935975,0.000183165,0.0001951252],"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.00001509256,0.0000253312,0.002180332,0.000006785368,0.000009531722,0.00003934648,0.0002017395,0.000009710162,0.0005806217,0.07573577,0.002333382,0.9188623],"study_design_scores_gemma":[0.00574332,0.002831586,0.02725348,0.0001188452,0.00003612521,0.001402568,0.001691237,0.270521,0.2461008,0.3022374,0.1395768,0.002486901],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001177456,0.0001734919,0.9886411,0.0009835504,0.0001003582,0.0001411365,0.000001227896,0.0003570637,0.008424596],"genre_scores_gemma":[0.04700089,0.000101843,0.9516202,0.0002619255,0.00006814868,0.000008262335,0.000001616719,0.000007936531,0.0009292079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9163755,"threshold_uncertainty_score":0.3717721,"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."}}