### Table 3. Kernel families recognized by XARK in Perfect. perfect

### Table 3. Perfectness and imperfectness of the kth power of the square lattice graph

"... In PAGE 3: ... The perfectness of S2(m, n) is discussed in our previous paper [8]. Table3 shows the perfectness and imperfectness of Sk(m, n) for small k and n. Table 3.... ..."

### Table 4. Perfectness and imperfectness of the kth power of the triangular lattice graph

"... In PAGE 4: ... Table4 shows the perfectness and imperfectness of Sk(m, n) for small k and n. To show the above theorems, we introduce some definitions.... ..."

### Table 3. Kernel Performance

1998

"... In PAGE 10: ... Commu- nication between the clusters reduces the speedup to less than 8 for the rest of the kernels, as they are not perfectly data parallel. Table3 shows the sustained bandwidth used by these kernels and demonstrates the effectiveness of the band- width hierarchy. The kernels sustain an average of 7.... ..."

Cited by 97

### Table 2. Directed graph of basic blocks for linear kernel

"... In PAGE 4: ... The branching block, B1, is executed n + 1 times. This infor- mation is captured by the directed graph of basic blocks in Table2 . The directed graph is parameterized on the dimensionality of the problem: ie.... In PAGE 6: ... 2.2 Real-time analysis of SVM decision function An analysis the directed graph (same approach as in Table2 ) of the SVM decision function shows that basic block B1, B2, and B3 have conditional branches. B1 is conditioned on the number of training examples, B2 is conditioned on a support vector being non-zero, and B3 is conditioned on the dimension of the training problem, n.... ..."

### 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 4: Procedures to Find the Stopfree Kernels of a Graph

1997