### Table 1: Fields and algorithms for manipulation tasks with programmable vector elds.

"... In PAGE 14: ... Furthermore, because of its full pixel- wise programmability, the new chip will allow us to closely approximate ideal radial elds. 7 Conclusions Table1 summarizes elds and algorithms for ma- nipulation tasks with programmable vector elds, and includes some additional recent results. Less di cult tasks such as translation can be achieved with relatively simple elds and without any planning.... ..."

### Table 1: Fields and algorithms for manipulation tasks with programmable vector elds.

"... In PAGE 16: ...al equilibria (i.e., force and moment). Finding tight bounds on the number of total equilibria|that is, tak- ing moment into account|will be critical in the future. 7 Conclusions Table1 summarizes elds and algorithms for manipu- lation tasks with programmable vector elds, and in- cludes some additional recent results. Less di cult tasks such as translation can be achieved with relatively simple elds and without any planning.... ..."

### Table 1: Fields and algorithms for manipulation tasks with programmable vector elds.

"... In PAGE 16: ...al equilibria (i.e., force and moment). Finding tight bounds on the number of total equilibria|that is, tak- ing moment into account|will be critical in the future. 7 Conclusions Table1 summarizes elds and algorithms for manipu- lation tasks with programmable vector elds, and in- cludes some additional recent results. Less di cult tasks such as translation can be achieved with relatively simple elds and without any planning.... ..."

### Table 1 Primitive Lie algebras of vector elds in C 2

"... In PAGE 6: ... Of particular interest are certain subgroups of the projective group SL(3) | Case 1.3 in Table1 . The Euclidean group E(2), which is a real form of the complex transformation group of Type 2.... ..."

### Table 2 Transitive, imprimitive Lie algebras of vector elds in C 2

### Table 4.3: Comparison of the MSE of motion estimates in R0 and R1 resulting from application of algorithms A and B at eld #2 of test image 5 with p(2) = [4 4 1 1]T. The estimated occlusion ^ o(2) and motion discontinuity elds ^ l(2) are shown in

1994

Cited by 3

### Table 2: NRI obtained by various 3 3 lters in the ltering of a motion vector eld corrupted by Laplacian noise.

"... In PAGE 11: ... 8b. The performance of this lter along with the performance of the marginal median, arithmetic mean, L1 norm vector median, marginal -trimmed mean ( = 0:33) and multichannel k-NN lter (k = (N + 1)=2, reference vector : 5 5 marginal median output, generalized distances) of the same window size, are given in Table2 . The NRI obtained by these... ..."

### Table 1: xed portion of a system description vector eld name purpose

1994

"... In PAGE 6: ...To determine the basis for the xed portion of the description vector, we re- viewed 18 algorithms from the existing scheduling literature [2{5, 7, 13, 17{20, 22{ 24, 26{28, 30, 31]. Table1 depicts the resulting data set. We found that only two characteristics|processor speed and inter-processor communication time estimates| were used by more than four algorithms.... ..."

Cited by 1

### Table 1: xed portion of a system description vector eld name purpose

"... In PAGE 6: ...To determine the basis for the xed portion of the description vector, we re- viewed 18 algorithms from the existing scheduling literature [2{5, 7, 13, 17{20, 22{ 24, 26{28, 30, 31]. Table1 depicts the resulting data set. We found that only two characteristics|processor speed and inter-processor communication time estimates| were used by more than four algorithms.... ..."

### Table 5.1 Convergence rate for the approxiamte vector eld ~ A to the exact solution

1999

Cited by 29