### Table 4.10: Absolute timings for the exponential (arbitrary units)

in Nathalie Revol and Arnaud Tisserand; • The MPFR developers, and especially the INRIA SPACES project;

2005

### Table 1: Number of connected and disconnected minor-order obstructions for k{Edge BoundedIndSet, for 0 k 12.

1997

"... In PAGE 6: ... For example, the union P2 [ K1 of a path of length 2 and an isolated vertex is an obstruction for 4{Edge Bounded IndSet. Looking at the rst few k{Edge Bounded IndSet graph families (0 k 12), the counts given in Table1 indicate, as expected, exponential growth in the number of obstructions. Table 1: Number of connected and disconnected minor-order obstructions for k{Edge BoundedIndSet, for 0 k 12.... ..."

Cited by 4

### Table 2. Reachability in the spherical case. with lower index. If this curve is oriented clockwise, the orientation of t is positive. The gure below shows some examples where Ind(t) = 2 and the orientation of t is positive.

1995

"... In PAGE 16: ...emma 3.3. The reachability information between u and v is uniquely determined by (i) the index of t, (ii) the orientation of t, and (iii) the appearance of pu and pv around s0 and t0. As Table 1 did in the plane case, Table2 shows the precise connec- tion (dashes denote arbitrary or unde ned entries). Note that indeed the reachability information is uniquely determined by the information above the rule.... In PAGE 22: ...nd T to nd their order around s0 and t0. Using Lemma 4.1 and the data structure above, we nd the index and orientation of t. Finally, we refer to Table2 for the answer. 4.... ..."

Cited by 3

### Table 1. The number of isomorphism classes of Bass, Gorenstein and arbitrary orders in H p and M2 = M2(K), when p is non-dyadic.

"... In PAGE 14: ...11) is easy to solve, since g(n) proves to be more or less a linear function. We summarise everything in Table1 , in which we separate orders in H p and M2 = M2(K). The two variables n and in Table 1 satisfy... In PAGE 14: ... We summarise everything in Table 1, in which we separate orders in H p and M2 = M2(K). The two variables n and in Table1 satisfy... In PAGE 18: ... The cases d(A) 2 f2; 3g are de nite algebras and the other two are inde nite. From Table1 , we get that there are 1 isomorphism class of orders with d(O3) = (72) = (32) in H 3 and 3 in M2(Q3). Furthermore, Table 3 implies... ..."

### TABLES TABLE I. Comparison of four Alternative Schemes : IW21, IW22 (Minimal) IW11 and IW00. N denotes the order of approximation, NV the number of variables, NC the number of constraints coming from balance equations, ND the number of degenerate equations, NI the number of inde- pendent equations and NA the number of arbitrary parameters determining the solution. In the NV column, a + b + c means a variables of reactive acceleration, b in energy ambiguity and c in angular momentum ambiguity. NNVNCNDNINA IW21: IW Scheme

1997

### TABLES TABLE I. Comparison of four Alternative Schemes : IW21, IW22 (Minimal) IW11 and IW00. N denotes the order of approximation, NV the number of variables, NC the number of constraints coming from balance equations, ND the number of degenerate equations, NI the number of inde- pendent equations and NA the number of arbitrary parameters determining the solution. In the NV column, a + b + c means a variables of reactive acceleration, b in energy ambiguity and c in angular momentum ambiguity. N NV NC ND NI NA

### Table 3: Exponential tail and the mixed exponential

"... In PAGE 7: ...01E-10 7.44E-13 mse-reduction 0% 0% 0% Table3 shows that for two of the cases, the IS esti- mator with the mixed exponential biasing distribution yields a smaller mse than those with the exponential tail p.... ..."

### Table 6. An example schema with associated INDs.

2002

"... In PAGE 14: ...4. The IND-Graph representation of the schema in Table6 (top nodes denoted by rectangular nodes). (a) If is unique, then there is a 1 : 1 relationship between s and t, and can be captured as lt;!ELEMENT t (Y, s?) gt;.... In PAGE 14: ... Example 3. Consider a schema and its associated INDs in Table6 . The IND-Graph with two top nodes is shown in Fig- ure 4: 1) course: There is no node t, where there is an IND of the form course[ ] t[ ], and 2) emp: There is a cyclic set of INDs between emp and proj, and there exists no node t such that there is an IND of the form emp[ ] t[ ] or proj[ ] t[ ].... ..."