{"id":"W1890828259","doi":"","title":"A trajectory splitting model for efficient spatio-temporal indexing","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Search engine indexing; Trajectory; Bounding overwatch; Computer science; Range (aeronautics); Set (abstract data type); Dynamic programming; Range query (database); Algorithm; Linear programming; Tree (set theory); Mathematical optimization; Mathematics; Combinatorics; Search engine; 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.001506866,0.0005177921,0.0008605529,0.0005737796,0.000631238,0.001430229,0.001777721,0.001187904,0.002723571],"category_scores_gemma":[0.005511404,0.0003864176,0.0005788283,0.001622631,0.0008589039,0.00466273,0.001108919,0.001566036,0.0008326553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001530823,"about_ca_system_score_gemma":0.001377054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004383138,"about_ca_topic_score_gemma":0.003367898,"domain_scores_codex":[0.9988183,0.0003095914,0.00007972421,0.0002763061,0.0003827425,0.0001332448],"domain_scores_gemma":[0.9978564,0.0009957183,0.0002650138,0.0004537912,0.0003075276,0.0001215263],"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.000167364,0.00009597743,0.001000675,0.000079171,0.00002391657,0.000135155,0.0002238179,0.8221907,0.008465356,0.1158144,0.002232879,0.04957054],"study_design_scores_gemma":[0.000006606295,0.00002421816,0.00006865271,0.000003580173,0.000003889267,0.00003655338,0.00001899314,0.9843433,0.0008091929,0.01381907,0.0008607261,0.000005368273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01460256,0.00010979,0.9838158,0.0001596568,0.00001125123,0.00004497034,0.0001247365,0.0001965698,0.0009346377],"genre_scores_gemma":[0.5028992,0.0004268173,0.4926741,0.00008313257,0.000068731,0.0002903267,0.0006490818,0.0001358015,0.002772779],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004383138,"threshold_uncertainty_score":0.01110697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03033275801181353,"score_gpt":0.2600813327572613,"score_spread":0.2297485747454478,"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."}}