### Table 2: Initial tree sizes

1997

Cited by 8

### Table 3. Initial trees maping

"... In PAGE 5: ... Thus, we shall have a SLIPN with this latter sub-formula, other connectives dealing with the lexicalization. Table3 sums up the translation. Note that for h =1, the two latter cases do not belong to the considered TAG.... ..."

Cited by 1

### Table 2: Initial search tree for diagram 4.

1993

"... In PAGE 6: ... Diagram 4 shows a position where Black can win by combining gain squares of independent threats. In Table2 we show the initial threat-space search tree. The tree does not contain straight fours or fives.... In PAGE 6: ...Table 2: Initial search tree for diagram 4. With the four gain squares of Table2 we can create six combinations of two gain squares. We remark that h9 and h10 are both gain squares and lie close enough on the same line, but their dependency trees conflict.... ..."

Cited by 3

### Table 3.3: The initial decision tree

2002

Cited by 1

### Table 3: Number of initial trees and auxiliary trees extracted from each corpus

"... In PAGE 2: ... We cluster these trees by their semantics and assign rel- ative frequencies to each tree. Table3 shows the number of initital trees we collected for each corpus. The grammars we obtain are probabilistic lexicalized tree-adjoining grammars with semantic features [Abeille and Rambow, 2000].... ..."

### Table 1 Full EVPI sampling #7B FRC 12 problem #7B initial tree 32 = 8

1998

"... In PAGE 32: ... Non zero entries in FRC 20 base scenario coe#0Ecient matrix For the EVPI-based sequential importance sampling experiments described here the last 12 annual rebalancing decisions were grouped into two year stages to make a 12 stage approximation FRC 12 of the full FRC 20 model. Table1 shows the results of 10 runs of the full EVPI importance sampling algorithm on the FRC 12 problem and Figure 8 depicts the progress of the se- quential algorithm in terms of the value of the expected terminal wealth objective of successive sample problems for the 10 runs. Table 2 and Figure 9 show compa-... In PAGE 33: ...7B 1.61#25 and 1.06#25 respectively for the full and marginal criteria. While this corresponds to an approximate 95#25 con#0Cdence interval of about 5#25 of objective value, much further experimentation with algorithm strategies and parameters is required. The instability of the terminal #0Crst stage decisions ^ x 1N shown for full EVPI in Table1 is perhaps worrying. Nevertheless, in both cases variance reduction #7B in the sense of number of scenarios retained in the #0Cnal sample tree versus #28partial#29 scenarios generated #7B is about an order of magnitude #28see Tables 1 and 2#29.... ..."

Cited by 2

### Table 2 Marginal EVPI sampling #7B FRC 12 problem #7B initial tree 64 = 8

1998

"... In PAGE 32: ... Table 1 shows the results of 10 runs of the full EVPI importance sampling algorithm on the FRC 12 problem and Figure 8 depicts the progress of the se- quential algorithm in terms of the value of the expected terminal wealth objective of successive sample problems for the 10 runs. Table2 and Figure 9 show compa-... ..."

Cited by 2

### Table III. CPU time in megacycles per 100,000 operations. Tree size = 4095 (times include time to build the initial tree)

1993

Cited by 15

### Table 3 Misclassification matrix using 32 initial windows through the vantage point tree initialization method Voter party

2006

"... In PAGE 7: ...re summarized in the boxplot exhibited in Fig. 5. As shown, for more than 16 initial windows the classification accuracy stabilizes around 90%. In Table3 , the results of GUKW are exhibited utilizing the vantage point tree and 32 initial windows. GUKW manages to discover two clusters that contain mostly objects of one of the two parties.... ..."

### Table 1. Excerpt from initial SOA decision tree

"... In PAGE 5: ... We have captured 130 such SOA decisions so far. Table1 lists selected ones from all four levels of abstraction introduced above, including their scope attribute and some of the alternatives available.... In PAGE 7: ... Decisions can be grouped into decision topics, which are embedded in curly braces. For example, topic area {Process Realization Decisions?} contains the pro- cess-scoped decisions that Table1 assigned to the conceptual level. The selection of a lt;ServiceCompositionTechnology? gt; is an example.... In PAGE 7: ... This engagement type is a superset of the Web service enablement; decisions about BPEL usage also have to be made in this engagement type. The scenario from Section 1 is an example; traversing all process and service realization decisions inclu- ding those in Table1... ..."