### Table 3: Rectification Accuracy

"... In PAGE 7: ... One concern is that the simulation-based approach will result in invalid corrections or corrections that are signif- icantly different than one might expect. Table3 compares the number of non-equivalent lines between the original and rectified circuits as a measure of rectification accuracy. In most cases the rectified circuit is identical to the original.... ..."

### Table 1. Degrees of Rectification

2001

"... In PAGE 5: ... In this case, the perspective distortion is reduced to an affine shear and the projection is described as a weak perspective projection. Table1 summarizes the degrees of freedom that remain uncorrected after different sets of linear features are found and different assumptions are made about the plane-to-camera geometry. Table 1.... ..."

Cited by 7

### Table 7-1. Events for graph-, node- and edge-labels

"... In PAGE 68: ... Table7 -2. Graph label specific events Event name Utilization Description DIRECTEDNESS_CHANGE after The directedness of the graph has been changed.... In PAGE 69: ... UNSET_END_NODE before A node as been removed from the end node set. Table7 -3. Node label specific events Event name Utilization Description SET_START after A node has been set to a start node.... In PAGE 70: ... Table7 -4. Edge label specific events Event name Utilization Description REVERT after The direction of the edge has been reversed.... ..."

### Table 2: Time to compute kernel matrix for given number of labeled graphs from various datasets. kernel delta linear

2006

"... In PAGE 7: ... On our two chemical datasets we used a delta kernel to compare edge labels reflecting types of bonds in molecules. We report results in Table2 and Figure 1 (right). On labeled graphs, our three methods outperform the direct approach by about a factor of 1000 when using the linear kernel.... ..."

Cited by 5

### Table 2: Time to compute kernel matrix for given number of labeled graphs from various datasets. kernel delta linear

2006

"... In PAGE 7: ... On our two chemical datasets we used a delta kernel to compare edge labels reflecting types of bonds in molecules. We report results in Table2 and Figure 1 (right). On labeled graphs, our three methods outperform the direct approach by about a factor of 1000 when using the linear kernel.... ..."

Cited by 5

### Table 2: Basic notations for labeled transition systems

"... In PAGE 7: ...for actions; and i; p; q; s : : :, for states. The notations are shown in Table2 that are relevant to a given LTS, as introduced in [6]. An LTS can also be represented by a directed graph where nodes are states and labeled edges are transitions.... ..."

### Table 6 Mesh features for the adaptive fracture problem. Adaptive direct

1997

"... In PAGE 9: ... Three and six meshes were necessary for the direct and multigrid methods, respectively, obtaining nal estimated errors of 1,1% and 1,3%. The meshes obtained are illustrated in Figures 10 and 11 with the main features given in Table6... ..."

Cited by 1

### Table 7: Mesh features for the adaptive fracture problem. Adaptive direct procedure

"... In PAGE 10: ...he direct and multigrid methods to obtain nal estimated errors of 1.1% and 1.3%. The meshes obtained are illustrated in Figures 10 and 11. The main features are given in Table7 where is the error obtained at the end of the mesh generation process. These results are shown in Table 8 and Figure 12.... ..."

### Table 1: Dependency graph edge labels

1997

"... In PAGE 6: ... These conditions are speci ed via labeled arcs within the AND-OR subgraph. Table1 describes the possible label types. Evaluating the dependency graph The depen- dency graph evaluation algorithm categorizes chatter equivalency classes as chattering, non-chattering, or chatter-unknown.... ..."

Cited by 2