| Id |
Subject |
Object |
Predicate |
Lexical cue |
| TextSentencer_T177 |
0-216 |
Sentence |
denotes |
In Greedy(k, R), a thorny problem is that there is no efficient way to compute R(S) given a placement S, and we turn to run snapshots for 10, 000 trials to obtain an accurate estimate of R(S), mentioned in Section 3. |
| TextSentencer_T177 |
0-216 |
Sentence |
denotes |
In Greedy(k, R), a thorny problem is that there is no efficient way to compute R(S) given a placement S, and we turn to run snapshots for 10, 000 trials to obtain an accurate estimate of R(S), mentioned in Section 3. |
| T13927 |
0-216 |
Sentence |
denotes |
In Greedy(k, R), a thorny problem is that there is no efficient way to compute R(S) given a placement S, and we turn to run snapshots for 10, 000 trials to obtain an accurate estimate of R(S), mentioned in Section 3. |
