Results 1 - 10
of
16,191
TABLE II ACTION LABELS FOR THE CVD CLUSTER TOOL
Table 1: Number of actions to label 1018 examples. By converting segmentation actions into classification actions, we can reduce the total number of annotation actions by 22%.
"... In PAGE 5: ... The result is that after a small number of actions, annotator can reduce the number of boundary labels needed to train the CRF, and instead mostly provide TYPE annotation. Table1 displays the total number of actions required to label all the unlabeled data. Note that BASELINE incurs a CHOICE action if the correct labeling is the top choice.... In PAGE 5: ... Note that BASELINE incurs a CHOICE action if the correct labeling is the top choice. The results in Table1 agree with the trends in Figures 2 and 3. Note that the increase in CHOICE actions is expected, since there are many instances where the correct labeling is in the top k choices.... ..."
Table IV. Labelled Transition System - Pre-actions
2004
Cited by 9
Table 5: Couplings of the fixed point action of Type II, labeled as in Table 4 . loop
2008
"... In PAGE 9: ...not available. Table 4 and Table5 contain the c1(C) coefficients obtained. We shall denote the action where these couplings are kept only by SFP q .... In PAGE 12: ... They are used only to encode information which would be difficult to present otherwise. The actions in Table 4 and Table5 satisfy the FP equation Eq. (3) on our configurations to a reasonable precision.... ..."
Table 3. Inference rules for transitions labelled by actions a 2 Act (P # and Q #)
Table 4.10 shows the actions to be performed when modelling a goto label type of direct jump statement.
Table 2 For each type of polluting assignment the monitor adds a node into the graph and labels it according to the action needed to improve the precision.
2005
"... In PAGE 15: ... These nodes rep- resent the sources of polluted information, and the labels indicate how to fix the im- precision. Table2 shows examples of polluting assignments and the actions taken for both pointers and constant propagation as an example client. The dependence graph contains two types of directed edges.... ..."
Cited by 3
Table 2 For each type of polluting assignment the monitor adds a node into the graph and labels it according to the action needed to improve the precision.
2005
"... In PAGE 15: ... These nodes rep- resent the sources of polluted information, and the labels indicate how to fix the im- precision. Table2 shows examples of polluting assignments and the actions taken for both pointers and constant propagation as an example client. The dependence graph contains two types of directed edges.... ..."
Cited by 3
Table 2 For each type of polluting assignment the monitor adds a node into the graph and labels it according to the action needed to improve the precision.
2005
"... In PAGE 15: ... These nodes rep- resent the sources of polluted information, and the labels indicate how to fix the im- precision. Table2 shows examples of polluting assignments and the actions taken for both pointers and constant propagation as an example client. The dependence graph contains two types of directed edges.... ..."
Cited by 3
Table 2 For each type of polluting assignment the monitor adds a node into the graph and labels it according to the action needed to improve the precision.
2005
"... In PAGE 10: ... These nodes represent the sources of polluted information, and the labels indicate how to fix the imprecision. Table2 shows examples of polluting assignments and the... ..."
Cited by 3
Results 1 - 10
of
16,191