### Table 1 are composed of minimally sufficient sets of RDs.

### Table 9. A set of sufficient conditions on ai for the differential path given in Table 8.

2005

Cited by 25

### Table 1. Sufficient Sample Sizes

"... In PAGE 5: ... For frequent itemset mining, the frequency is usually low, so the above requirement is easy to meet. In Table1 , the sufficient sample sizes derived from different bounds are given. For multiplicative Chernoff bounds, the minimum support threshold is set to 0.... ..."

### Table 1. The Senses of Transitive Kai As mentioned above, traditionally dominant has been the view that a category is defined by a set of criterial attributes, i.e. necessary and sufficient conditions for class

### Table 3: Instances of A sufficiently similar to B3.

"... In PAGE 4: ... Then for each source value, the target table is queried for values having have scores from Equation 4 that exceed a given threshold. Such generated pairs, as in Table3 , are then passed on to the next phase of processing. (Note that as an alternative to keeping all pairs with scores above a given threshold, the top r ranked pairs could be retained instead.... In PAGE 4: ...3.2 Creating edit recipes for pairs With a set of pairs of similar instances from column A to column Bk ( Table3 ), we next find a partial translation formula that will match the common information between the two sets of column in- stances. We achieve this by looking for longest common substrings... ..."

### Table 4 reports the model that results for UK. Our method confirms the results reported in Caporale et al. (1997)). No additional dummy variables, i.e. not directly derived from the marginal models, turn out to be necessary. A sufficient set of dummies is needed to achieve a well-specified equation, in particular the inclusion of the dummies is necessary to achieve normality of the residuals. Moreover, these models are parsimonious in that only a minimum set of dummies from the marginal processes is significant. Thus, there is evidence of presence of co-breaking (Hendry, 1996), such that some of the breaks of the marginal processes are eliminated in the conditional model. Finally, the main conclusion that we may draw from the conditional model is that we are far away from a stable relationship between money, income

### Table 7.2: Network Parameterization for the Dimension Test: The GNG parameterization is very close to the defaults commonly used by Fritzke, the maximal edge age being the key pa- rameter. The ITM parameterization disables reference vector adaptation, and sets a resolution which triggers the generation of sufficiently many nodes.

### Table 1 shows how for the purposes of this procedure, the phonemes of standard British English have been group to form a set of visemes. The viseme set is inevitably a compromise between the desire to reduce the number of images needed and the desire to ensure that sufficient phonetic distinctions are retained.

### Table 1. Summary of rotation distances between trees with n nodes, with upper bounds for all sufficiently large n.

2006

"... In PAGE 3: ... It is only when we allow an infinite set of rotations along the right arm of the tree that we obtain the multiplicative constant of 2 in the upper bound, analogous to ordinary rotation distance. These rotation distances and bounds, which hold for sufficiently large n, are summarized in Table1 , where n is the number of nodes... In PAGE 14: ....2. Bounds on restricted rotation distances. Now that we have described the relationship between the different rotation distances and word lengths in F , we obtain numerical bounds on these rotation distances as summarized in Table1 . We note that word length of an element of F computed with respect to a generating set of the form S given above has the potential to be much shorter than the word length of the same element computed with respect to the generating set {x0, x1}.... ..."