{"id":"W76416230","doi":"10.1007/978-1-4613-0251-3_7","title":"Exact parallel algorithms for the location depth and the maximum feasible subsystem problems","year":2004,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Hyperplane; Parallelizable manifold; Mathematics; Enumeration; Generalization; Dimension (graph theory); Point location; Algorithm; Point (geometry); Parametric statistics; Set (abstract data type); Space (punctuation); Combinatorics; Mathematical optimization; Computer science; Geometry; Mathematical analysis; 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.0004831628,0.0002649974,0.0002424911,0.0001207973,0.0007866786,0.000374571,0.0004127358,0.0001805427,0.00002096003],"category_scores_gemma":[0.0000257577,0.000178478,0.00007405181,0.0002090422,0.0001251425,0.0002783501,0.0001119196,0.0001678515,0.00001473117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006246447,"about_ca_system_score_gemma":0.0002160147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001011451,"about_ca_topic_score_gemma":0.00001791028,"domain_scores_codex":[0.9985764,0.00003157941,0.0004184963,0.0005413985,0.0002660232,0.0001661021],"domain_scores_gemma":[0.9981828,0.0004004645,0.0003542854,0.0004519096,0.0005263247,0.00008417525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005411457,0.00001191346,4.374725e-7,0.0000603206,0.00003747535,6.258842e-8,0.0001654008,0.2621792,0.000001561695,0.7199528,0.0002082885,0.01737709],"study_design_scores_gemma":[0.001221193,0.00003592848,0.00001237827,0.00004638617,0.00007920079,0.00002046551,0.0000166927,0.9031783,0.000008254416,0.03359735,0.0615494,0.0002344172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[5.253327e-7,0.006629331,0.9760784,0.004449022,0.0001506128,0.003619907,0.00002043801,0.00008760888,0.008964187],"genre_scores_gemma":[0.07681076,0.0370544,0.558872,0.00509129,0.004031036,0.01800731,0.00273409,0.0003535747,0.2970456],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6863555,"threshold_uncertainty_score":0.7278122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03167241883879291,"score_gpt":0.2544493348698125,"score_spread":0.2227769160310196,"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."}}