{"id":"W2164431548","doi":"10.1109/iccv.2007.4408970","title":"Capacity Scaling for Graph Cuts in Vision","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Scaling; Maxima and minima; Computer science; Graph; Maximum cut; Maximum flow problem; Time complexity; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Geometry","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.002683486,0.001949621,0.001641689,0.002794156,0.001398947,0.003477419,0.003288341,0.002302314,0.01378127],"category_scores_gemma":[0.02423441,0.001031665,0.001759221,0.003551114,0.003213474,0.008843179,0.005387776,0.005990023,0.002644321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003806045,"about_ca_system_score_gemma":0.00150756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00367223,"about_ca_topic_score_gemma":0.002898125,"domain_scores_codex":[0.9968664,0.0009246013,0.0001346074,0.0007399823,0.0009601916,0.0003741531],"domain_scores_gemma":[0.9865371,0.009007235,0.0008184698,0.002072593,0.0009440099,0.0006204735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002783925,0.0001233873,0.0006898097,0.0004618963,0.00005142524,0.0001449009,0.0003091464,0.3296104,0.004991471,0.5528954,0.01464135,0.09580251],"study_design_scores_gemma":[0.00001560078,0.00003774209,0.000162139,0.00004325922,0.00001507444,0.00008477826,0.00003852387,0.6115418,0.001391889,0.3824843,0.004164383,0.00002043748],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0144812,0.001991726,0.9627773,0.001521559,0.0002235362,0.0001244836,0.0003368434,0.001355869,0.01718753],"genre_scores_gemma":[0.5182877,0.004010619,0.4568409,0.00147937,0.001148892,0.000947079,0.001290724,0.001887772,0.01410697],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01378127,"threshold_uncertainty_score":0.046103,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02652783890698657,"score_gpt":0.3351410557630669,"score_spread":0.3086132168560803,"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."}}