Results 1 - 10
of
66,558
Table 3: Background characteristics relevant to selection of image tracking algorithms.
1994
"... In PAGE 3: ... But most environmental fac- tors are subject to change or cannot always be known in advance. Table3 summarizes the background char- acteristics that our robot considers when choosing the right image-tracking algorithm. 5 A Suite of Real-Time Tracking Algo- rithms The tracking algorithms described here form a set of complementary techniques that can be run in real time with currently available hardware, and are capa- ble of being used without user intervention n28e.... ..."
Cited by 12
Table 12: Performance of the advanced algorithm for pronoun anaphora
1994
"... In PAGE 21: ... 3.4 #5CSmart quot; Pronoun Implementation Results Table12 shows the performance of the advanced heuristic, and table 13 shows a simple breakdown of the errors. Again the baseline totals have been included in table 12 for easy comparison.... ..."
Table 7: Breakdown of the errors for the advanced algorithm.
Table 6: Performance of the advanced algorithm for de nite noun phrase anaphora.
"... In PAGE 16: ...\Smart quot; Implementation Results Table6 shows the performance of the advanced heuristic. The baseline to- tals are also shown, for comparison.... ..."
Table 6: Performance of the advanced algorithm for de#0Cnite noun phrase
1994
"... In PAGE 15: ...#5CSmart quot; Implementation Results Table6 shows the performance of the advanced heuristic. The baseline to- tals are also shown, for comparison.... ..."
Table 1. Algorithms RV-Simple(left) and RV-Advanced.
2004
Cited by 2
Table 5. Comparison between LVQPRU and three advanced algorithms.
"... In PAGE 31: ...Similar observations are obtained in Table5 , in which the comparison results... ..."
Table 9: Detailed analysis of errors made by advanced algorithm. `* apos; marks
1994
Table 3: Dynamic Relevance Algorithm
1998
"... In PAGE 6: ... Finally, it checks to see if the complement of R is irrelevant by checking to see if the actions in R yield the same final state as the entire sequence. A more efficient incremental implementation is given in Table3 . This algo- rithm would be called whenever we try to grow an action sequence by adding a new action a.... ..."
Cited by 7
Results 1 - 10
of
66,558