CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 8914-9128 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/CORD-19/sourceid/6e2db98aa242e3e84116afdfad5e250943c55ac5","sourcedb":"CORD-19","sourceid":"6e2db98aa242e3e84116afdfad5e250943c55ac5","text":"Based on these bounds, we further propose a new Upper Bound based Greedy (UBG in short) algorithm which can significantly reduce the number of estimations in greedy-based algorithms, especially at the initial step.","tracks":[{"project":"Epistemic_Statements","denotations":[{"id":"T27","span":{"begin":0,"end":214},"obj":"Epistemic_statement"}],"attributes":[{"subj":"T27","pred":"source","obj":"Epistemic_Statements"}]}],"config":{"attribute types":[{"pred":"source","value type":"selection","values":[{"id":"Epistemic_Statements","color":"#9398ec","default":true}]}]}}