### Table 1: Shared memory access in equal-size partition.

1997

"... In PAGE 30: ...umber of partitions by local memory. Therefore, only communications are considered. The experiments consist of simulations with uniform nested loops benchmarks from [10], wave digital lters used to solve transmission line problems (WDF) and two-dimensional in nite impulse response lters (IIR) from [24]. Table1 shows the results of such simulations. The rst column de ne the problem being solved, the second column speci es the local memory assumed, column partition number lists the number of partitions obtained by the multi-level partitioning technique and is used in all the cache replacement strategies in the experiment, columns LRU, FIFO and carrot-hole (C-H) present the number of external... ..."

Cited by 1

### Table 2: Equal-size partition and varied-size partition.

1997

Cited by 1

### Table 5. Overall classification accuracy (%) of spatial boosting for the 3 equal-size class problems for real life test

2001

Cited by 1

### Table 5.5: Experimental Results for Steiner Triple Systems

2005

### Table 6: Comparison of Equal Sized QAP and LA Problem Instances Problem

"... In PAGE 16: ...As the examples in Table6 indicate, the LA problem has far fewer local minima as compared to an equal sized QAP, regardless of which of the three problem-size criteria are considered. This corresponds to the LA problem instances having very large basins of attraction about the local minima.... ..."

### Table 6: Comparison of Equal Sized QAP and LA Problem Instances Problem

"... In PAGE 16: ...As the examples in Table6 indicate, the LA problem has far fewer local minima as compared to an equal sized QAP, regardless of which of the three problem-size criteria are considered. This corresponds to the LA problem instances having very large basins of attraction about the local minima.... ..."

### Table 7.8 The number of edges cut by the equal-sized partitions output by the various algorithms (see Section 7.4). Note that since the Eppstein mesh is weighted, the cut cost is not an integer.

2006

Cited by 3

### Table 1 shows the number of possible systems of nested dichotomies for up to 12 classes for the class-balanced (CBND) and the unconstrained case (ND). It shows that a non-trivial number of CBNDs can be generated for classification problems with five or more classes. Figure 2 shows the algorithm for building a system of class-balanced nested dichotomies. At each node the set of classes is split into equal size subsets (of

"... In PAGE 4: ...Number of Number of class-balanced classes nested dichotomies nested dichotomies 2 1 1 3 3 3 4 15 3 5 105 30 6 945 90 7 10,395 315 8 135,135 315 9 2,027,025 11,340 10 34,459,425 113,400 11 654,729,075 1,247,400 12 13,749,310,575 3,742,200 Table1 . Comparison of the number of possible trees.... ..."

### Table 1: Volume ratios for equal sizes (second column), and size ratios for equal volumes (third column). Geometries

2001

"... In PAGE 3: ... Each spectrum should be rescaled in the frequency axis, holding the condition of volume constancy. Table1 (second column) shows, according to the chosen geometries, volume ratios for resonators having the same size1 in the sense of figure 2. In the third column, size ratios for resonators having the same volume are shown.... ..."

Cited by 2