### Table 1: Statistics of test examples. g, genus of domain manifold M; Nf , # of faces in M; Nb, # of boundaries in M; Ns, # of singularities; Nc, # of control points; Tricci, time for computing the discrete Ricci flow and isometric embedding (Step 3 and 5 in Section 4); Tspline, time for the spline construction; n, degree of splines. Note that time measures in seconds. Object g

2007

Cited by 5

### Table 6. Canonical redundancy analysis Canonical

2003

"... In PAGE 7: ... Although the first and second canonical functions are ignificant according to the above analysis, it is mmended that redundancy analysis be utilized to etermine which functions should be used in the terpretation [37]. Redundancy is defined as the ability of f independent variables, taken as a set, to explain the ariation in the dependent variables taken one at a time Table6 summarizes the redundancy analysis for the dent and independent variables for the two canonical unctions that were found to be significant by using the easure of model fit. The results indicate that the first onical function accounts for the highest proportion of otal redundancy (93.... ..."

Cited by 2

### Table 6. Canonical redundancy analysis Canonical

2003

"... In PAGE 7: ... Although the first and second canonical functions are ignificant according to the above analysis, it is mmended that redundancy analysis be utilized to etermine which functions should be used in the terpretation [37]. Redundancy is defined as the ability of f independent variables, taken as a set, to explain the ariation in the dependent variables taken one at a time Table6 summarizes the redundancy analysis for the dent and independent variables for the two canonical unctions that were found to be significant by using the easure of model fit. The results indicate that the first onical function accounts for the highest proportion of otal redundancy (93.... ..."

Cited by 2

### Table 1: Rij is a Ricci tensor of manifold M corresponds with metric Gij. R is a scalar curvature. There gij is a metric of the Euclidean space.

### Table 1. Canonical curves

"... In PAGE 5: ... However, we can simplify greatly the exposition by considering \canonical curves quot; obtained by some change of variable. Table1 contains the most general equations for non-supersingular elliptic curves. For the case p = 2, we refer to [38].... ..."

### Table 1: Canonical Implementations

"... In PAGE 17: ...emory using the GNU C/C++ compiler, version 2.7.2. Table1 shows that qweil is by far the fastest canonical implementation. On all instances, including the small ones, qweil is faster than CC and stabcol.... In PAGE 18: ...Table1 shows that ts is faster than stabcol and thus the fastest implementation of an algorithm for computing coherent algebras with a theoretical time bound of O(n3 log n). We have implemented a non canonical version of qweil by just skipping the sorting at certain points in the algorithm.... ..."

### Table 1: Canonical Implementations

"... In PAGE 11: ...Table1 shows that ts is faster than stabcol and thus the fastest implementation of an algorithm for computing coherent algebras with a theoretical time bound of O(n3 logn). We have implemented a non canonical version of qweil by just skipping the sorting at certain points in the algorithm.... In PAGE 12: ...emory using the GNU C/C++ compiler, version 2.7.2. Table1 shows that qweil is by far the fastest canonical implementation. On all instances, including the small ones, qweil is faster than CC and stabcol.... ..."