### Table 2: The relative errors in depth computation using our invariant algorithm, for a ne and rigid shape. Rigid Invar. Rigid random A . Invar A . random 8:4% 27:6% 2:9% 23:3%

1995

"... In PAGE 6: ... 3.) Table2 summarizes the results of our invariant algo- rithm for the last 8 points. Due to the noise in the data and the large perspective distortions, not all the frames were consistent with rigid motion.... ..."

Cited by 56

### Table 2: The relative errors in depth computation using our invariant algorithm, for a ne and rigid shape. We compared in Table 3 the average relative error of the results of our algorithm to the average relative error of a random set of 3D points, aligned to the ground truth data with the optimal similarity or a ne transformation. Rigid Invar. Rigid random A . Invar A . random 8:4% 27:6% 2:9% 23:3%

1995

"... In PAGE 18: ... similar sequence in [25] Fig. 4, or [15] Fig. 3.) Table2 summarizes the results of our invariant algorithm for the last 8 points. Due to the noise in the data and the large perspective distortions, not all the frames were consistent with rigid motion.... ..."

Cited by 56

### Table 3. Random networks 3. Computation times (in seconds)

"... In PAGE 12: ... It proves also to be the best method over the problems reported in the table (that however have low arc density). The results of our last set of experiments on random networks are reported in Table3 . The aim here is to understand how the methods scale up when the number of nodes is increased.... ..."

Cited by 1

### TABLE 1 Local Network Positions

2005

Cited by 2

### Table 1: Average number of local minima with respect to 2-exchange local neighborhoods in random MAPs with iid assignment costs

2006

"... In PAGE 11: ...istribution we used the well-known polar method (see, e.g., Law and Kelton, 1991). Table1 shows the average number of local minima with respect to 2-exchange neighborhoods N2. For small sized problems, the number of local minima was computed exactly by complete enumeration of all feasible solutions in a given instance of the problem; the values in Table 1 have been obtained by averaging over 100 problem instances.... In PAGE 12: ....e., the expected number of local minima with respect to 3-exchange neighborhoods is smaller than that for 2-exchenge neighborhoods for same-sized problems. Figure 1 visualizes the experimentally determined number of local minima in random MAPs as presented in Table1 , along with the developed bounds (17), for instances with fixed d = 6 (left) and n = 6 (right) and assignment costs drawn from the above three distributions. The logarithmic scale is used due to the exponential growth of the corresponding values with n and d.... ..."

### Table 1: List of available elements Aerodynamic Rigid

"... In PAGE 5: ... The most commonly used have already been implemented, to allow the modelling of common mechanisms. Table1 lists the available elements. Most of them are based on the orthogonality condition of twovectors, namely ei aT ej b = 0, where the subscripts refer to the bodies the vectors belong to, and the superscripts refer to the directions in the local reference frame.... ..."

### Table 1. The mean wiring length, L, and R value for local and random conectivity paterns on a 40-unit network with 8 paterns.

"... In PAGE 4: ... The networks are thus not evolving to perform wel with a single, specific, set of training paterns. Results Table1 shows the final evolved values of L and R together with the coresponding initial values in a random network and a completely local network. It can be sen that the GA has ben sucesful in finding a patern of conectivity that almost halves the total amount of wiring whilst maintaining god patern-corection performance.... ..."

### Table 1: Performance in the presence of computation load and network traffic with automatically selected nodes and random nodes

1999

"... In PAGE 7: ... Our experience and previous results indicate that random node selection and node selection based on static network properties give virtually identical performance on a small testbed with all high speed links like ours [15], and hence the random selection results also apply to static node selection procedures. The results are presented in Table1 . Each mea- surement is the average of a number of executions spanning several hours.... ..."

Cited by 33

### TABLE 3. Local Indices: Results for Abilene

### Table 2. Docking flexible and rigid ligands

in Notes

2001

"... In PAGE 4: ...ted. Assuming complete additivity (i.e., independence) of these side chains, the conformations were recombined on the fly during docking to create 109 to 1040 conformations of each ligand ( Table2 ). For three ligands, we explored not only different residue conformations but also different resi- due substitutions.... In PAGE 4: ... These 200 mutations were recombined to produce 2010,or 1013 mutants, from which we selected the best scoring mol- ecules. During docking, between one million and 20 million orientations were evaluated for each conformation/mutation ( Table2 ). Docking calculations on Pentium III computers (up to 800 MHz) took up to 12 h of CPU time (Table 2).... ..."