{"id":"W2065795466","doi":"10.1007/s002360000044","title":"Analysis of range search for random k-d trees","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypercube; Combinatorics; Mathematics; Range (aeronautics); Binary search tree; Nearest neighbor search; Range tree; Conjecture; Theory of computation; Search tree; Regular polygon; Tree (set theory); Probabilistic logic; k-nearest neighbors algorithm; Discrete mathematics; Search algorithm; Algorithm; Computer science; Interval tree; Binary tree; Statistics; Data mining; Artificial intelligence","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.0003743357,0.00005622856,0.000168353,0.0003923209,0.00006374319,0.00005697194,0.0003001786,0.00002494986,0.00003607429],"category_scores_gemma":[0.00005609803,0.00004792557,0.000123518,0.001254849,0.0000155145,0.0005981223,0.00005209048,0.00002877425,0.000008541562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001044823,"about_ca_system_score_gemma":0.00003869987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006398639,"about_ca_topic_score_gemma":0.000007619487,"domain_scores_codex":[0.9992957,0.00001763387,0.0002754395,0.00007444091,0.0002125,0.0001242824],"domain_scores_gemma":[0.9992024,0.000317124,0.00007191489,0.0002187884,0.0001479274,0.00004189156],"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.0005125296,0.0003963622,0.009913599,0.0002141176,0.002749619,0.000002543338,0.01743171,0.1826733,0.001827649,0.1510584,0.008654566,0.6245655],"study_design_scores_gemma":[0.0008577061,0.00006281076,0.008137691,0.000004080449,0.00008682165,0.000001470657,0.00004028732,0.980004,0.0009935846,0.0002819952,0.009453805,0.00007575035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1264734,0.00001645426,0.8692681,0.0005028269,0.00005550277,0.00016762,0.000005626689,0.00002728531,0.003483167],"genre_scores_gemma":[0.9779598,0.00001573398,0.02160116,0.0001898007,0.00002678431,0.00001704773,0.00003269213,0.000001543552,0.000155425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8514864,"threshold_uncertainty_score":0.1954348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02391396967433926,"score_gpt":0.2798554499238107,"score_spread":0.2559414802494714,"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."}}