### Table 1: Confusion matrix for the Mahalanobis distance ex- pression classifier in the original space, using 130 unknown test images.

### Table 2: Confusion matrix for the Mahalanobis distance ex- pression classifier in the LDA space, using 130 unknown test images.

### Table 3: Confusion matrix, for a nearest neighbor classifier in the original space, using 130 unknown test images.

### Table 4: Confusion matrix, for a nearest neighbor classifier in the LDA space, using 130 unknown test images.

### Table II: Number of unknowns and mesh spacing for the adaptive mesh hierarchy used to solve the problem pictured in Figure 8. The resolution on the nest grid level corresponds to a uniform mesh of size 5123.

### Table 3: Possible equality and incidence relations AHBN BEBN CK BI BP BN between lists of observed space points CGCX, lines C4CX, and planes BTCX (top column) and unknown space points CHCX, lines C5CX and planes BUCX (left row). The algebraic formulation of the constraints are bilinear with respect to the unknowns and observations. The matrices CCCC, CCCC, C1 and C1 are given in table 1.

2001

Cited by 5

### Table 3: Possible equality and incidence relations ; 2; \ 6= ; between lists of observed space points Xi, lines Li, and planes Ai (top column) and unknown space points Yi, lines Mi and planes Bi (left row). The algebraic formulation of the constraints are bilinear with respect to the unknowns and observations. The matrices TT, TT, I and I are given in table 1.

2001

Cited by 5

### Table 1 Number of unknowns and mesh spacings for the levels of the re nement hierarchy. Multigrid Levels Adaptive Re nement l = 0 l = 1 l = 2 l = 3 l = 4 l = 5 l = 6 Total

1995

Cited by 4

### Table IX lists the statistics for these two designs. For this experiment, we used a space compactor with eight outputs. The target observable percentage is set at 90% and the unknown percentage is 0.3%.

in Abstract

### Table 3: Elapsed time for performing various operations in each iteration of complex- symmetric QMR on a Sun SPARCstation10, and total solution time at kd = =6. Mesh (Unknowns) Preconditioner

1995

"... In PAGE 23: ... In order to compare the computational performance of various preconditioners, we summarize elapsed times required for performing the matrix-vector product, the preconditioning steps and the overall time spent within each iteration of QMR. Table3 presents such a summary of elapsed times for various preconditioners on a Sun Sparc10 workstation. The computation of matrix-vector products was performed using the element-by-element procedure described in section 6.... ..."

Cited by 8