CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 8914-9128 JSONTXT

{"project":"Epistemic_Statements","denotations":[{"id":"T27","span":{"begin":0,"end":214},"obj":"Epistemic_statement"}],"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."}