### Table 1. The proposed fast motion estimation algorithm.

"... In PAGE 2: ... In the following stages, CX BP C2 are used for computing BW CX . The proposed multiresolution motion estimation method algo- rithm is shown is Table1... In PAGE 4: ...0000 4. EXPERIMENTAL RESULTS The two-dimensional version of algorithm of Table1 was used for finding the best match for each block in each frame of video se- quences, from a search conducted in its neighborhood in the pre- vious frame. For the first 30 frames of the gray-scale, 8 bit-per-pixel, BFBIBCA2 BEBKBK , salesman video sequence, with blocks of size BDBI A2 BDBI,and search area of BFBF A2 BFBF (W=16), and D4 BPBE, the proposed method gives an speed up of more than 36 compared to a full search.... ..."

### Table 1: Performance of FF, RRT-Plan, and LPG on various domains. Entries list the number of problems the planner could not solve within ve minutes of CPU time. Domain FF RRT-Plan LPG

"... In PAGE 7: ... We generated 20 domains, starting with one block/goal atom and moving up to 20. Figure 5 shows the number of problems solved by the planners within a given time length, while Table1 shows the number of problems solved by FF and RRT-Plan on sev- eral standard planning domains. These statistics were gen- erated by allowing the planners to run for up to ve minutes and recording the time to completion.... In PAGE 7: ... RRT-Plan is of course a randomized algorithm and there- fore can produce different results on different runs. While we have not performed exhaustive testing, the numbers in Table1 change only slightly (in one test suite we observed only 6 failures on Pipesworld, in another 1 failure in Push- Block). This is probably because the average completion time for some problems is around the 5 minute cutoff and therefore variation can mean the problem sometime regis- ters as a failure.... ..."

### Table 1: Autonomous Vehicle Example: Services and Alternatives

1998

"... In PAGE 6: ...e., services) and with each a number of alternatives { see Table1 . This example will be returned to later in the paper.... ..."

Cited by 25

### Table 1: Computational complexities of the fast motion estimation algorithms described.

"... In PAGE 21: ... To perform a direct comparison among the computational e ciencies of the fast search methods, the computational complexity of each method has been formulated for a motion displacement of size w. Table1 shows the computational complexities of the methods when w is a power of 2. Some logarithmic searches may not be able to search all the positions at the boundaries of the search window.... ..."

### Table 12. Fast full search motion estimation algorithms Algorithm Savings NTT Algorithm Savings

2002

"... In PAGE 66: ... The 48-point algorithm minimizes the count of general multiplications, where nei- ther of the multiplicands is a constant, but nonetheless it does not perform well, since the congruent reduction after a multiplication in that case is so slow operation. The approximative comparison between different fast full search algorithms is given in Table12 , where higher percentage means higher computation savings, as compared to ESA, and thus faster algorithm. However, it should be noted that there are much more considerations than just the plain execution speed given in the table: many papers benchmark motion estimation methods with good-quality video sequences with little noise and often with little motion.... In PAGE 69: ... Unlike other fast full search algorithms, or even conventional search strategies such as Three Step Search, correlation-based algorithms (as NTT) have absolutely regular data flow, and they are therefore most suitable for ASIC implementation in this aspect. The rough comparison between different fast full search algorithms is given in Table12 , but in many applications the savings will be less for methods which are not based on corre- lation. Additionally, from many papers it is not clear how the algorithms were implemented.... ..."

Cited by 1

### Table 2: Autonomous Jack Instructions

"... In PAGE 47: ... When recording scripts, one has to take into consideration where (in three dimensions) Jack is planned to perform a task. Also, a numeric index is used to choose the different tasks presented in Table2 . Writing a scripted lesson is relatively easy since the planner just moves through the world and looks in the direction where he wants the events to happen.... ..."

### Table 2: Autonomous Jack Instructions

"... In PAGE 47: ... When recording scripts, one has to take into consideration where (in three dimensions) Jack is planned to perform a task. Also, a numeric index is used to choose the different tasks presented in Table2 . Writing a scripted lesson is relatively easy since the planner just moves through the world and looks in the direction where he wants the events to happen.... ..."

### Table 2. Fast full search algorithms. Motion estimation algorithm Savings

in A New Algorithm for Fast Full Search Block Motion Estimation Based on Number Theoretic Transforms

"... In PAGE 4: ... In the Table 1 the algorithmic operation counts (indexing is not accounted) and the time used are shown for the estimation of one motion vector. Table2 compares the NTT-based motion estimation algorithm to results reported in the literature for other fast full search algorithms. In the soft- ware implementation, the NTT algorithm do not appear to surpass other fast full search algorithms.... ..."

Cited by 1

### Table 4: Algorithm Motion Rotation Axis Angle Translation

1999

"... In PAGE 31: ... 12(a). Table4 : Estimated parameters for the vehicle and background motions shown in Fig. 13.... ..."

Cited by 49