### Table 5: Sequences of I(10) AUGC folding into the same secondary structure are decomposed into mutationally connected components using single base exchanges and base pair sub- stitutions as variation operators.

2005

"... In PAGE 67: ... The fact, that the highest ranking structures of I(10) AUGC occur with almost the same frequency, is in agreement with the results obtained from large samples derived by folding random sequences of fixed chain length [7, 22, 73]. Table5 shows the decomposition of I(10) AUGC into Gl k components. The three largest structure components are connected networks.... ..."

### Table 1: Iteration counts with several momentum preconditioners in 2D

"... In PAGE 10: ....1.1 Momentum preconditioners For the solution of the momentum equations we always use the GMRES(60) method, meaning that the GMRES method is restarted after 60 iterations. In Table1 we give the number of iterations needed by GMRES when solving the momentum equations using the following preconditioners: none No preconditioner. diagonal Left multiplication of the matrix with the inverse of its diagonal.... ..."

### Table 2. Summary of implementation techniques for iteration.

"... In PAGE 11: ...849 Table2 summarizes methods of implementation for iteration and their variations. The languages that provide the construct(s) are annotated at the end.... In PAGE 11: ... The iteration is used to compute the sum of a linked list of integers. We implement the iteration by using the four techniques available in C++: iterator, formal procedure parameter, inheritance, and macro expansion (the four labeled with C++ in Table2 ). A version of a directly coded loop, which breaks encapsulation of a linked list, is also developed for comparison.... ..."

### Table 1 Examples of techniques used to improve the standard ICP algorithm Aspect Proposed techniques

2006

"... In PAGE 2: ....2. Our work Range image registration directly determines the accuracy of the camera motion parameters estimated and the 3D model reconstructed. The traditional closest point criterion [2,5,37] is so natural and effective in practice for the registration of overlapping range images that it has attracted a great deal of effort to improve it ( Table1 ) and it has actually become a de facto standard approach for image registration. However, it introduces false matches in almost every iteration of the algorithm due to a number of reasons to be discussed in Section 2.... ..."

### Table - 2: Benefits of Using Improved Drying-Techniques, as Compared to the Traditional Drying Method

### Table 5. Learning techniques

2003

"... In PAGE 22: ...nderlying technologies, e.g., support vector machines [Cristianini and Shawe-Taylor, 2000]; improved links between reinforcement learning and stochastic control theory [Bertsekas and Tsitsiklis, 1996]; advances in planning and learning methods for stochastic environments [Littamn, 1996; Parr, 1998]; and improved theoretical models of simple genetic algorithms [Vose, 1999]. Major types of learning techniques are summarized in Table5 [Zimmerman and Kambhampati, 2001; Nordlander, 2001]. ... ..."

Cited by 2

### Table 4. Proposed Strategies to Improve Hand Washing Technique and Complianc e

"... In PAGE 9: ... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Table4 . Proposed Strategies to Improve Hand Washing Technique and Compliance .... In PAGE 16: ... It may also be due to real or perceived obstacles , such as understaffing, inconveniently located hand washing facilities, an unacceptable hand washing product or dermatitis caused by previous hand washing. A number of strategies have been suggested to improv e compliance ( Table4 ). Long-term success will require development of programs and sustained efforts a t promoting compliance with hand washing.... ..."

### Table 6: Momentum preconditioners in 3D

"... In PAGE 11: ...2.1 Momentum preconditioners In Table6 results are presented using the following preconditioners: none No preconditioner. diagonal Left multiplication of the matrix with the inverse of its diagonal.... In PAGE 13: ... 4.3 Iteration counts using di erent number of grid points in 3D From Table6 we conclude, that the MILUD preconditioner is again much better than that of the multiplicative version. The results in Table 7 show that in 3D the approximate inverse can compete with RILUD.... ..."

### Table 4: Improvements of various techniques using the word-

1990

Cited by 11

### Table 3: Parameters used in Analysis

"... In PAGE 18: ...workflows correspond to the second variety, in general the benefits from the OCR scheme is considerable while paying a small overhead. The rest of the analysis focuses on the load at a node and the number of messages exchanged based on various parameters and the values we have assumed for them as shown in Table3 . The value ranges were chosen based on intuition since performance studies related to workflow execution in the presence of failures and under different architectures are not available.... ..."