### Table 1: Values of the I1-type feature used to the identify the vehicle class, truck 1. The feature consisted of point set f4; 7; 8; 10g, corresponding to the points labeled in gure 6. The feature value is formed using the thermophysical model of truck 1 and the data from the respective other vehicles. When this feature is applied to the correctly hypothesized data of the tank it has a mean value of -0.57 and a standard deviation of 0.13. This I1-type feature produces a good stability measure of 4.5, and good separability between correct and incorrect hypotheses. The feature values for incorrect hypotheses are at least 3.32 standard deviations away from the mean value for the correct hypothesis.

"... In PAGE 23: ...image of the car at locations given by transforming the coordinates of the van points (in the van center coordinate frame) to the image frame computed for the unknown vehicle. Table1 shows inter-class and intra-class variation for a feature of type I1 for the truck 1 object class { for images obtained at eight di erent times over two days. The behavior of the invariant feature formed by one choice of a set of 4 points is shown in table 1 for correct hypothesis.... ..."

### Table 4: Independent vs. grouped t 3D depths for the box{seq. 3D Depths from Indepen- dent (Ind.) Fits vs. Grouped (Gpd.) Fits for 12 sample points compared with Pose Depths for the box{seq (in mm.).

1993

"... In PAGE 32: ...66mm. In Table4 , the depth estimates from independent and grouped ts for a sample set of 12 points are compared. The points are labelled in Figure 22.... ..."

Cited by 6

### Table 1: for the special algorithms.

1998

"... In PAGE 8: ...worth noting that there is only one minimally redundant NST algorithm for every radix b. Table1 summarizes the values of , and for these special algorithms, for power of two radices: 2 b 32. Notice that the only possible radix 2 NST division ( = 1, = 0, = 1 2) is Burgess apos; algorithm [7], where rj 1rj 2 are recoded in the following two cases: 11 = 0 1 and 1 1 = 01.... In PAGE 8: ... However, no matter what the analysis is, the quotient-digit selection function comes up to be the same as that of the general development presented in this paper. An algorithm not listed in Table1 and deserving special attention concerns the digit-set D lt;16:10 gt;, because all the digits in such a digit-set can be represented as the sum of two digits from the radix 4 signed-digit-set D lt;4:2 gt; (i.... ..."

Cited by 3

### Table 1: Optimization algorithm.

1995

"... In PAGE 8: ... In the following, the number of sweeps performed will be denoted by smax. A summary of the algorithm is given in Table1 . In the special case of an orthogonal subspace decomposi- tion, Khg;j 0, and there is no inter{scale feedback in (20).... ..."

Cited by 15

### Table 2. Results of the algorithm to nd optimal special n-Brinkhuis triples with generating words in A1(n).

### Table 3. Results of the algorithm to nd optimal special n-Brinkhuis triples with generating words in A2(n).

### Table 6.1: A list of approximation algorithms for the MDDN problem for special classes of graphs.

### Table 1. Comparison of results for various approaches.

"... In PAGE 8: ... 4. Numerical Results Table1 compares the balance and uniformity (t,s) of (n,2) de Bruijn sequences... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. ------------------------- Table1 goes here ------------------------- In Table 1, we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. -------------------------Table 1 goes here ------------------------- In Table1 , we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... ..."

### Table 1: Schema Optimization Problem

"... In PAGE 4: ... Theorem 1 (1) Given an initial schema Q, a search space L, and a bound LIM, the problem of finding a subset C c L, such that C does not contain the root of L, every q E Q can be derived from some c E C and ICI 5 LIM is NP-complete. (2) Given a performance ratio r, r gt; 1, to find an algorithm A for the Schema Optimization Problem de- fined in Table1 whose performance is bounded by r times the optimal performance is NP-hard. Theorem 1 tells us that the optimization problem is a very difficult one.... ..."

### Table 2: Points used in derivatives computation Name x y z

"... In PAGE 10: ... A program was built to calculate the required partial derivatives by numerical di erentiation. Table2 gives the coordinates of the points in the envelope for which partials were computed; it extends the o cial envelope to a wider box in the region around the \home quot; position in order to support beam switching. Tables 3 through 8 display the computed partials.... In PAGE 15: ... Motions in z larger than 0:83 inch may be desirable in order to move the beam between feedhorns separated by up to about 14 inches in the Gregorian focal plane while maintaining optimal imaging quality. Probably the best way to implement this will be to modify PCD apos;s rmware implementation so that it will permit displacements inside the box de ned by the eight points labelled \G x y z quot; in Table2 in addition... ..."