### Table 5 Accurate Sparse Approximate Inverse Patterns Thresh Level Filter Ratio Iter Setup Solve Total

2001

### TABLE C.11 Z-Scores for Trial-Level Standard Deviations, by Laboratory and Gender Data BL LO HI

2000

Cited by 4

### Table 2: A comparison of communication overheads predicted by the approximate, accurate and LogP models. It is clear that the approximate model predicts the overhead accurately in asymptotics for every algorithm. The LogP model however fails to do so for the mesh architecture for every algorithm.

"... In PAGE 28: ...orse runtimes. Detailed analysis of these algorithms is presented in Appendix A. From the appendix, it also becomes clear that our models are much simpler to analyze algorithms for. Table2 presents communication overheads predicted by each model for Fast Fourier Transforms (FFT), matrix-matrix product, sample sort and Gaussian elimination.... ..."

### Table 2: A comparison of communication overheads predicted by the approximate, accurate and LogP models. It is clear that the approximate model predicts the overhead accurately in asymptotics for every algorithm. The LogP model however fails to do so for the mesh architecture for every algorithm.

"... In PAGE 28: ...orse runtimes. Detailed analysis of these algorithms is presented in Appendix A. From the appendix, it also becomes clear that our models are much simpler to analyze algorithms for. Table2 presents communication overheads predicted by each model for Fast Fourier Transforms (FFT), matrix-matrix product, sample sort and Gaussian elimination.... ..."

### Table 3: First and second order standard deviation and standard error approximations (first order approximations in brackets) for accurate regression coefficients.

1998

"... In PAGE 20: ...y 0.25. The resulting standard deviations and standard errors, and correlations of the phytomass fractions for a stand of age 50, site index 3.0 and relative stocking of 80% are listed in Table3 and Table 4, respectively. Both first and second order approximations are provided.... ..."

### Table 9: Statistics for 3D incremental Delaunay tetrahedralization of several point sets. Timings are accurate to within 10%. The approximate code failed to terminate on the tilted grid input.

1997

"... In PAGE 50: ... Of course, this penalty applies precisely for the point sets that are most likely to cause difficulties when exact arithmetic is not available. The results for 3D, outlined in Table9 , are less pleasing. The four-stage predicates add about 35% to the total running time for randomly distributed input points; for points distributed approximately on the surface of a sphere, the penalty is a factor of eleven.... ..."

Cited by 86

### Table 9: Statistics for 3D incremental Delaunay tetrahedralization of several point sets. Timings are accurate to within 10%. The approximate code failed to terminate on the tilted grid input.

1997

"... In PAGE 50: ... Of course, this penalty applies precisely for the point sets that are most likely to cause difficulties when exact arithmetic is not available. The results for 3D, outlined in Table9 , are less pleasing. The four-stage predicates add about 35% to the total running time for randomly distributed input points; for points distributed approximately on the surface of a sphere, the penalty is a factor of eleven.... ..."

Cited by 86

### Table 4 Comparison of exchange and correlation energies of Be for LDA and the various GGA apos;s with the corresponding accurate values. The approximate functionals are evaluated for the exact (not the self-consistent) densities. The numbers in parentheses are the percentage errors. Energies are in Hartree atomic units. Taken from Ref. [47]. Functional

### Table 2 shows the reputations computed by node B respectively in the scen- arios (a) and (b) illustrated in Fig. 1. In the first scenario, where the peers are completely connected, it is possible to observe that B accurately approximates the reputation of the other peers with only 10 protocol runs (i.e., for each neigh- bor both 10 direct interactions and 10 reputation exchanges). Given a trustor and a trustee, the associated reputation also depends on the social distance, i.e.,

2004

"... In PAGE 8: ...Table2 .... ..."

Cited by 3