{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003118158,0.0004662061,0.001363084,0.002479661,0.0008384466,0.001471787,0.002213343,0.00141201,0.00718216],"category_scores_gemma":[0.03435514,0.0006409947,0.0009441848,0.002086767,0.001446809,0.002823842,0.002022168,0.001045671,0.0006104148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001559073,"about_ca_system_score_gemma":0.00111866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002162992,"about_ca_topic_score_gemma":0.002081783,"domain_scores_codex":[0.9981219,0.0007420895,0.00006780638,0.0001790094,0.0006197612,0.0002693043],"domain_scores_gemma":[0.9674063,0.02882425,0.0009856876,0.001006622,0.001234262,0.0005428416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004064697,0.0001272099,0.003172997,0.0003070215,0.00007199606,0.0001259268,0.000171678,0.8144604,0.001898788,0.1379557,0.004390959,0.0369109],"study_design_scores_gemma":[0.00001703467,0.00003208685,0.0003028869,0.0000202861,0.00001177055,0.00006186136,0.0000317468,0.9776149,0.0003355547,0.02118269,0.0003812827,0.000007842776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3424763,0.004884756,0.621604,0.001564935,0.00009310107,0.0002304368,0.000626948,0.0009538902,0.02756566],"genre_scores_gemma":[0.915819,0.001025558,0.07644429,0.0002022588,0.00008586027,0.0001676827,0.000613148,0.0003673081,0.005274963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00718216,"threshold_uncertainty_score":0.02402669,"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."}}