CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 22017-22230 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T173","span":{"begin":0,"end":213},"obj":"Sentence"}],"text":"Eq. (14) is proven and we thus get that R(S) is submodular.ᮀ By above properties in Theorem 4, the problem given in Eq. (9) can be approximated by the greedy algorithm in Algorithm 1 with the set function f : = R."}

    CORD-19-Sentences

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T173","span":{"begin":0,"end":213},"obj":"Sentence"},{"id":"TextSentencer_T173","span":{"begin":0,"end":213},"obj":"Sentence"},{"id":"T17144","span":{"begin":0,"end":213},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"Eq. (14) is proven and we thus get that R(S) is submodular.ᮀ By above properties in Theorem 4, the problem given in Eq. (9) can be approximated by the greedy algorithm in Algorithm 1 with the set function f : = R."}

    Epistemic_Statements

    {"project":"Epistemic_Statements","denotations":[{"id":"T67","span":{"begin":4,"end":119},"obj":"Epistemic_statement"}],"text":"Eq. (14) is proven and we thus get that R(S) is submodular.ᮀ By above properties in Theorem 4, the problem given in Eq. (9) can be approximated by the greedy algorithm in Algorithm 1 with the set function f : = R."}