{"id":"W2802936684","doi":"10.1007/s10589-018-0007-1","title":"A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions","year":2018,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mathematics; Piecewise linear function; Adjacency matrix; Vertex (graph theory); Bivariate analysis; Time complexity; Graph; Algorithm; Combinatorics; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.00033146,0.000159628,0.0001937299,0.000145898,0.0005769698,0.0001131541,0.0004358785,0.00004943329,0.00006063913],"category_scores_gemma":[0.00004955407,0.0001312857,0.00005103201,0.0009866827,0.0001954395,0.0001720944,0.0001972495,0.0001266592,0.0002176537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001935846,"about_ca_system_score_gemma":0.0001261364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001678056,"about_ca_topic_score_gemma":0.000001062918,"domain_scores_codex":[0.9986307,0.00009579593,0.0003920697,0.0003847782,0.0003208693,0.0001758065],"domain_scores_gemma":[0.9981975,0.0002960521,0.000190111,0.0003651541,0.000806813,0.0001443645],"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.000003215436,0.00008338391,0.0000222724,0.000007075678,0.00003076489,2.551906e-7,0.00032037,0.930939,0.00002660355,0.03015878,0.0007583607,0.03764995],"study_design_scores_gemma":[0.000311245,0.0001007447,0.0003387332,0.00001315755,0.00001636145,0.00001056159,0.00001525996,0.9841659,0.00003034701,0.002251133,0.01260001,0.0001465345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001447555,0.0000429867,0.9938651,0.004383076,0.0001124007,0.0005207969,0.00002915534,0.0001648192,0.0007369469],"genre_scores_gemma":[0.03114288,0.00001105909,0.9659063,0.001563841,0.0003933519,0.0001387404,0.0001155201,0.00001830058,0.0007100484],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05322694,"threshold_uncertainty_score":0.5353677,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00804029159818934,"score_gpt":0.2573365794171292,"score_spread":0.2492962878189399,"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."}}