### Table 1. Comparison of results between grids with and without diagonals. New results

1994

"... In PAGE 2: ... For two-dimensional n n meshes without diagonals 1-1 problems have been studied for more than twenty years. The so far fastest solutions for 1-1 problems and for h-h problems with small h 9 are summarized in Table1 . In that table we also present our new results on grids with diagonals and compare them with those for grids without diagonals.... ..."

Cited by 11

### Table 4 are for a rotor machine with odometer-like rotation for rotors one and two and pseudo random rotation for rotor three.

1997

"... In PAGE 6: ... Table4 : Average results for nding the correct last rotor with 4732 letters of ciphertext and a GA popu- lation of 50 5 COMPARISONS Iterative Technique for the Three Rotor Problem We implemented the technique in [1] for a three rotor system on the same machine as the GA. The algorithm found the correct three rotor machine for plaintext 1 with 4732 and 4056 letters in 394 and 589 iterations but with 3380 letters it had only achieved a correct de- cipherment rate (CDR) of 10% after 1000 iterations.... ..."

Cited by 1

### Table 2: The eight rotation axes chosen at random.

### Table 2: The eight rotation axes chosen at random.

### Table 1: Improvement of the estimated rotation parameters for the `planar surfaces apos; in the presence

1999

"... In PAGE 8: ... In the examples of the `planar surfaces apos; and the `teapot apos; model, the motion elds were arti cially disturbed by uniformly distributed random noise, in order to illustrate how the proposed guidelines improve the algorithm apos;s performance in the presence of noise. In this sense, Table1 depicts the improvement in the estimation of rotation parameters for the `planar surfaces apos; for increasing number... ..."

Cited by 1

### Table II Rotations Applied In Hamiltonian Algorithm n Rotations Applied

### Table III. Randomized structuresa

### Table 19 Congruence Coefficients Obtained for Targeted and Randomly-Rotated Components

"... In PAGE 86: ...amely, that they are highly similar, ranging from .74 to .93. These are presented in Table19 . Also presented are the results of a procrustes rotation to a set of 1000 random targets based on a permutation of each component in the target matrix.... ..."

### Table 6. HyperCuts algorithm using a random access pipeline model - Total memory utilization and the percentage of wasted memory for our balanced pipeline (BPW) and conventional pipeline (CPW).

2005

"... In PAGE 7: ... In our simulation we used the subtrees originated in the second level nodes (the root node is at level 0). The results in Table6 show that a conventional pipeline ar- chitecture implementation may require more than three times the amount of memory used by the non-pipelined version. In contrast our pipelined scheme increases the memory usage by only 30%.... ..."

Cited by 5