{"id":"W1516165084","doi":"10.1007/11523468_15","title":"Worst Case Optimal Union-Intersection Expression Evaluation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Expression (computer science); Computer science; Upper and lower bounds; Set (abstract data type); Algorithm; Mathematical optimization; Discrete mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002401212,0.001291927,0.001882688,0.001214781,0.001523213,0.004176883,0.003200546,0.001554483,0.02723538],"category_scores_gemma":[0.007386532,0.0008104078,0.001306733,0.002821904,0.001621408,0.006551674,0.00303955,0.001774898,0.005013606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002379672,"about_ca_system_score_gemma":0.002694704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00264,"about_ca_topic_score_gemma":0.005490457,"domain_scores_codex":[0.9953393,0.0009224095,0.0002155593,0.0005085379,0.002049087,0.0009651248],"domain_scores_gemma":[0.9968461,0.00137187,0.000102034,0.000823068,0.0007701372,0.00008668382],"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.002271931,0.0004002262,0.00139883,0.0006085372,0.0001242864,0.0002874735,0.0002781579,0.1010471,0.01678445,0.1744013,0.04827827,0.6541195],"study_design_scores_gemma":[0.0001378467,0.0002078609,0.0006576682,0.000113642,0.0001476478,0.0004686663,0.0002645176,0.6791972,0.03949466,0.2606055,0.01863409,0.00007083253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05097846,0.001934136,0.8616037,0.001142176,0.0003992344,0.0002098099,0.0007861439,0.007069725,0.07587659],"genre_scores_gemma":[0.443289,0.0006714297,0.5078623,0.0004104219,0.0001894598,0.0001775422,0.001945192,0.002289976,0.04316468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02723538,"threshold_uncertainty_score":0.09111148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01933709617362351,"score_gpt":0.2493565460742919,"score_spread":0.2300194499006684,"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."}}