{"id":"W2342101233","doi":"10.1007/s10846-016-0367-7","title":"Efficient Cholesky Factor Recovery for Column Reordering in Simultaneous Localisation and Mapping","year":2016,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cholesky decomposition; Minimum degree algorithm; Incomplete Cholesky factorization; Computation; Computer science; Factorization; Factor (programming language); Algorithm; Graph; Factor graph; Column (typography); Sparse matrix; Theoretical computer science","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.0007644522,0.001427085,0.00106529,0.0008480788,0.0007117359,0.0009479495,0.0008769642,0.000946823,0.005091739],"category_scores_gemma":[0.004795625,0.0005856837,0.0007374121,0.001275411,0.0006709814,0.001562027,0.001400816,0.001610687,0.002734883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004323561,"about_ca_system_score_gemma":0.002040559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01076211,"about_ca_topic_score_gemma":0.01596427,"domain_scores_codex":[0.9992024,0.0002085677,0.00005700237,0.0001355709,0.000274628,0.0001216947],"domain_scores_gemma":[0.9980452,0.0008646331,0.0001098972,0.0004190837,0.0004784772,0.00008262981],"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.0009454887,0.0002329329,0.001011432,0.0003346747,0.0001322003,0.0002523318,0.00024119,0.1472829,0.07281321,0.0166488,0.01456128,0.7455436],"study_design_scores_gemma":[0.00004410752,0.0001145519,0.0004859545,0.00001696854,0.00002025965,0.0001131638,0.00008304096,0.9603726,0.02648094,0.007462414,0.004765842,0.00004012349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008213813,0.0002082308,0.9899341,0.0001365381,0.00006995157,0.00003533467,0.0001181387,0.000787948,0.0004958971],"genre_scores_gemma":[0.144341,0.000328505,0.8491773,0.0001316079,0.0001014947,0.0001446457,0.0008573,0.0002778933,0.004640243],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01076211,"threshold_uncertainty_score":0.0213989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01923271351544059,"score_gpt":0.2215039765602167,"score_spread":0.2022712630447761,"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."}}