### Table 3: Symbol Den0cnitions

1993

"... In PAGE 38: ...Table3 summarizes a number of terms used in our proof. The minimum and maximum frame times are in terms of real n5cwall-clock quot; time; that is, the nominal time for one slot n02 the number of slots per frame n02 the maximum or minimum possible clock rate.... ..."

### Table 1: Problem Statistics for the Maxcut Comparison name n dens% S dens% L

2001

"... In PAGE 17: ...3), with the rst twelve coming from the same Gset collection as above, the next thirteen coming from the Second DIMACS Challenge on the Maximum Clique problem [7] (for which the Lov asz theta number represents an upper bound on the size of a maximum clique), and the nal six coming from the Seventh DIMACS Implementation Challenge as mentioned above. The data in Table 3 is similar as in Table1 , though here we point out that n (the size of the matrices in our formulation) equals one plus the number of vertices of the underlying graph, m (the number of additional primal constraints) equals the number of edges, and the density of S roughly represents the density of edges in the graph. Also, p = 0 for this formulation.... ..."

Cited by 7

### Table 3: Problem Statistics for the Theta Comparison name n m dens% S dens% L

2001

"... In PAGE 17: ...3), with the rst twelve coming from the same Gset collection as above, the next thirteen coming from the Second DIMACS Challenge on the Maximum Clique problem [7] (for which the Lov asz theta number represents an upper bound on the size of a maximum clique), and the nal six coming from the Seventh DIMACS Implementation Challenge as mentioned above. The data in Table3 is similar as in Table 1, though here we point out that n (the size of the matrices in our formulation) equals one plus the number of vertices of the underlying graph, m (the number of additional primal constraints) equals the number of edges, and the density of S roughly represents the density of edges in the graph. Also, p = 0 for this formulation.... ..."

Cited by 7

### Table 6: Problem Statistics for the Frequency Assignment Comparison name n m p dens% S dens% L

2001

"... In PAGE 19: ...see Section 2.4) that were obtained from A. Eisenblatter, one of which, fap09, was used in the Seventh DIMACS Implementation Challenge. The statistics for the problems are given in Table6 , and we point out that n is the number of edges in the underlying graph and that the sum of m and p is the number of edges. In addition, the density of S corresponds to the density of the edges in the graph.... ..."

Cited by 7

### Table 3 Variation in optical bone density of two sites in mandible (Den A and Den B) by race and gender

"... In PAGE 3: ... For this reason, no further comparison on density B was performed. Separate t-tests ( Table3 ) found that there was a significant diC128erence in density A due to race between males (P=0.0094) and females (P=0.... ..."

### Table 3. Denning-Sacco protocol, with formal declarations

2005

"... In PAGE 4: ... For the sake of clarity, we enforce fresh generated names to be declared explicitly. Table3 shows the Denning-Sacco protocol using our framework.... ..."

Cited by 4

### Table 8n3a Den0cnitions of valof and valofcell.

1995

"... In PAGE 43: ... Proof of Theorem 13 Recall from Section 5 thatn2c in order to prove a correctness theoremn2c we needed a den0cnition of how to unwind a term from a store. The den0cnition of two mutuallyn2d recursive functions for performing this taskn2c valof and valofcelln2c appears in Table8 . It is obvious from the den0cnitions that only the reachable cells an0bect the value returned by valof and valofcell.... ..."

### Table 1: Classification of system behaviour and state [Den91]

"... In PAGE 2: ...Table 1: Classification of system behaviour and state [Den91] Table1 summarizes the classification of possible system behaviour and state. For every appli- cation we can distinguish between desirable versus undesirable behaviour on the one side and anticipated versus unanticipated behaviour on the other side.... ..."

### Table 1. Randomly generated unweighted instances; dens 2 [47; 51]%.

1997

Cited by 20

### Table 1: A summary of structural changes to the den- dritic neuron.

1997

"... In PAGE 6: ... Both methods of synapse regulation were investigated. The results after growth and regulation are illustrated in Figure 4 and summarised in Table1 . The area of the dendritic tree of the single neuron is superimposed on Figures 4 (b) and (c) as the shaded polygon.... In PAGE 6: ...) Clearly the dendritic tree is structurally less complex and the number of synapses has been ratio- nalised. The nal two columns of Table1 compare the two methods of synapse regulation: tree-wide and neuron- speci c. Tree-wide re nement results in a focusing of a neuron apos;s dendritic tree into a smaller area (see Fig- ure 4(c)).... ..."

Cited by 4