### Table 1: Results for mapping FEM graphs to mesh-connected systems

1994

"... In PAGE 5: ...Table 1: Results for mapping FEM graphs to mesh-connected systems Table1 compares some results of mapping a FEM- graph to different mesh-connected machines by Simulated Annealing and the Kohonen-process. We do not claim that the results achieved by SA are the best one can obtain using this method, but we actually put some effort into tuning the parameters of the algorithm.... ..."

Cited by 2

### Table 1: Results for mapping FEM graphs to mesh- connected systems

1994

"... In PAGE 5: ...Table 1: Results for mapping FEM graphs to mesh- connected systems Table1 compares some results of mapping a FEM- graph to different mesh-connected machines by Simulated Annealing and the Kohonen-process. We do not claim that the results achieved by SA are the best one can obtain using this method, but we actually put some effort into tuning the parameters of the algorithm.... ..."

Cited by 2

### Table 1: Mesh compression results using our Hand-and- Glove encoding (HG) compared to Edgebreaker (EB), both including an adaptive arithmetic coder (aac) stage. Cost is reported as bits-per-triangle for mesh connectivity.

"... In PAGE 8: ... Without any opti- mization, a simple adaptive arithmetic encoder [MNW98] on this raw bit-stream reduces the cost down to about 1.5 bits per triangle as shown in Table1 . This compares very well to other standard connectivity encodings such as an Edge- breaker implementation from [Shi] which we also followed by an arithmetic coding stage.... ..."

### Table 1: Mesh compression results using our Hand-and- Glove encoding (HG) compared to Edgebreaker (EB), both including an adaptive arithmetic coder (aac) stage. Cost is reported as bits-per-triangle for mesh connectivity.

"... In PAGE 8: ... Without any opti- mization, a simple adaptive arithmetic encoder [MNW98] on this raw bit-stream reduces the cost down to about 1.5 bits per triangle as shown in Table1 . This compares very well to other standard connectivity encodings such as an Edge- breaker implementation from [Shi] which we also followed by an arithmetic coding stage.... ..."

### Table 1. DI-GRUBER Accuracy Performance with Mesh Connectivity

Cited by 1

### Table 1: Comparison of computational cost for a regular grid, for linear and nonlinear problems; typically, the average numbers for an arbitirary grid are close. For the hinge, triangle-averaged and midedge normal stencils the number of DOFs per energy term in the interior of the mesh does not depend on mesh connectivity. The diagrams show in red the boundary of the area in which all DOFs share an energy term with the vertex DOF marked with the red dot. For the midedge normal operator we average over all (vertex and edge) DOFs.

2006

"... In PAGE 8: ... Figure 11: From left to right: a surface obtained by minimiz- ing thin plate energy using the cotangent discretization; same surface after 10 iterations of normal smoothing; a surface ob- tained using the midedge normal discretization, with vertex normals computed by averaging face normals; same surface with midedge normals used to compute vertex normals. Finally, we compare the computational cost of several opera- tors (see Table1 ). We consider two measures of efficiency: the number of floating-point operations needed to evaluate the en- ergy or its Hessian, and the number of nonzeros in the Hessian matrix, which typically determines the cost of a solve.... ..."

Cited by 6

### Tables 1 - 3 compare the complexity of these algorithms with those for the hypercube and mesh connected computers.

1991

Cited by 9

### Table 2 The bitrates of single-rate mesh connectivity coding algorithms Category Algorithm Bitrate (bpv) Comment

2005

"... In PAGE 16: ....1.7. Summary Table2 summarizes the bitrates of various connectivity coding methods reviewed above. The bitrates marked by C212*C213 are the theoretical upper bounds obtained by the worst-case analysis, while the others are experimental bitrates.... ..."

### Table 4 Dynamically reconfigurable parameters and tradeoffs

"... In PAGE 30: ... This issue is especially important for multimedia. Table4 presents a summary of varied computational parameters and corresponding observed tradeoffs. The tradeoffs provide valuable information that can be used to develop a hardware controller block.... ..."

### Table 6: Direct Environment Faults and Environment Perturbations

2000

"... In PAGE 9: ... Here, n is a file name, and hence the object is the file referred to using this file name. Then we refer to Table6 and get a list of at- tributes that need to be perturbed. This list includes 1) file existence, 2) file ownership, 3) file permission, 4) sym- bolic link, 5) file content invariance, 6) file name invari- ance and 7) working directory.... In PAGE 11: ... It seems pretty safe to give every- body the right to modify this registry key until we have found a module in the system that invokes a function call to actually delete this file. To know whether the program has done the correct checking before the delete or not, we did a perturbation on the properties of this file according to Table6 , making it writable only by administrator, and also making it point to a very important file (such as sys- tem configuration file, password file) instead of just a font file. It turns out that the program fails to respond securely under this environment perturbation - when administrators run this module, they will actually delete the file specified by this registry key regardless of whether this file is a font file or a security critical file.... ..."

Cited by 10