{"id":"W2109064983","doi":"10.1109/im.2003.1240280","title":"Approximate K-D tree search for efficient ICP","year":2004,"lang":"en","type":"article","venue":"","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":238,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Tree (set theory); Mathematics; Depth-first search; Backtracking; Search tree; Algorithm; Outlier; Convergence (economics); Search algorithm; Combinatorics; Computer science; Statistics","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.00005521665,0.0000588031,0.00005966398,0.00003969137,0.00003161336,0.00002060341,0.00004279742,0.00003169946,0.00001556097],"category_scores_gemma":[0.000003725153,0.0000519675,0.00002991155,0.00007956448,0.000008269676,0.00001355474,0.00000501624,0.00002958076,0.0000258821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004121337,"about_ca_system_score_gemma":0.000007643966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007461052,"about_ca_topic_score_gemma":0.000006210047,"domain_scores_codex":[0.9996045,0.000002234889,0.00008453941,0.00007612878,0.00007638345,0.0001562134],"domain_scores_gemma":[0.9998258,0.00001271971,0.000003363966,0.00009313331,0.00002578526,0.00003916409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002224903,0.00001463998,0.000008458356,0.00003407428,0.000004923735,5.074565e-7,0.00005700593,0.9769238,0.002189508,0.01942303,0.0001169699,0.001224906],"study_design_scores_gemma":[0.0004117352,0.00002167791,0.00005172344,0.000006189105,0.000003414661,7.241725e-7,0.00002834567,0.9483266,0.05046422,0.0002083603,0.0003997201,0.00007724221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06071126,0.00001938146,0.9311946,0.00008988487,0.00009985407,0.0001757374,0.000002591673,0.0001921048,0.007514601],"genre_scores_gemma":[0.9857929,0.000005384957,0.01393211,0.00003410019,0.00003935029,0.000009782162,0.00001528648,0.00002146503,0.0001496293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9250816,"threshold_uncertainty_score":0.2119173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01716140711530028,"score_gpt":0.2296673267466452,"score_spread":0.2125059196313449,"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."}}