### Table 6.1: Test set: Approximated tree width of vig using mdfi, separating vertex set of vig using the diameter (ds-set) and balanced approximated minimal cut of chg using hMeTiS along with its resulted balance.

in or

2006

### Table 4 Change in vertex separator size, for edge and vertex separator methods, when imbalance is introduced. Relative average vertex degrees for vertex and edge separator.

1998

"... In PAGE 16: ... Let us now consider whether the above intuitive explanation of the behavior of the methods agrees with the experimental data. Table4 shows three columns of results. The first two columns show the change in size of the top-level separator when we move from a balanced separator to an unbalanced separator.... In PAGE 17: ... However, the results are qualitatively similar to the mean operation counts observed when ordering the entire problem. The third column of results in Table4 compares the average degree of the vertices in the top-level separator for the unbalanced edge and vertex separator methods. A ratio of 0.... ..."

Cited by 10

### Table 4: Change in vertex separator size, for edge and vertex separator methods, when imbalance is intro- duced. Relative average vertex degrees for vertex and edge separator. Change in Change in Relative avg. separator size: separator size: vertex degree for Problem

1996

"... In PAGE 14: ... Let us now consider whether the above intuitive explanation of the behavior of the methods agrees with the experimental data. Table4 shows three columns of results. The rst two columns show the change in size of the top-level separator when we move from a balanced separator to an unbalanced separator.... In PAGE 15: ... However, the results are qualitatively similar to the mean operation counts observed when ordering the entire problem. The third column of results in Table4 compares the average degree of the vertices in the top-level separator for the unbalanced edge and vertex separator methods. A ratio of 0.... ..."

### Table 1: Selection criteria for each of the four D mesons. Listed are the minimal transverse momenta of the daughter tracks (cuts on the slow pion s are only applicable for the D meson) and the requirements on the vertexing parameters (see text).

2004

"... In PAGE 8: ... D meson decay candidates are selected by applying requirements on the following vari- ables: the minimal transverse momentum pt of daughter tracks, a signed impact parameter3 d of significance Sd = d= d for at least two tracks, the secondary vertex fit probability PVF , the error on the decay length measurement l and the vertex separation significance Sl = l= l. The detailed cuts, chosen to optimise the signal significance, are listed in Table1 . At most one missing CST hit is allowed for each D meson candidate.... In PAGE 9: ... No explicit particle identification is applied, and each track is assumed to be either a kaon or a pion as appropriate. The tracks of suitable charge are required to pass the transverse momentum criteria specified in Table1 . They are then fitted to a common secondary vertex, which must also fulfil the requirements listed in Table 1.... In PAGE 9: ... The tracks of suitable charge are required to pass the transverse momentum criteria specified in Table 1. They are then fitted to a common secondary vertex, which must also fulfil the requirements listed in Table1 . The number of signal events is then determined for each D meson individually by fitting the invariant mass distributions of the candidate combinations with a Gaussian to describe the signal and an appropriate background shape.... ..."

### Table 1 Minimal separation for some optimal spherical codes

"... In PAGE 3: ...imension and eight points (i.e. eight sets of tri-symbols). An analytical solution to this problem is difficult to find, fortunately, a list of optimal spherical code has been found in [12]. For example, in Table1 we list a few set of spherical codes with their dimension, number of points, and the minimum separation in terms of angle that is obtained from [12]. The exact configuration of spherical code with 3-dimension and 16-points is shown in Appendix A as an example.... ..."

### Table 3: Vertex sequences: Weight and position sequences are shown separately. Index from ! V ! to Weight Position Weight

1999

"... In PAGE 4: ... Tables 3 and 4 respectively show the vertex sequences and edge sequences found by the code optimization. Nota- tion 1 ! 0 ! 2 in row 2 of Table3 means that vertex 0 has in-edge from vertex 1 (1 ! 0) and out-edge to vertex 2 (0 ! 2). Note that the edge sequences with high weights, such as 0 ! 2, 0 ! 3, and 2 ! 3 have more A/T pairs than G/C pairs.... ..."

Cited by 9

### Table 1: Efficiency on vertex enumeration (continued)

"... In PAGE 24: ... It should be noted that strictly speaking, lrslib solves a slightly different, easier problem than the one solved by the other systems: while the latter guarantee the result is minimized, the output of lrslib may contain duplicate rays. Table1 : Efficiency on vertex enumeration input PPL New Polka PolyLib cddlib lrslib pd ccc4.e 0.... In PAGE 26: ...Table1 : Efficiency on vertex enumeration (continued) input PPL New Polka PolyLib cddlib lrslib pd project2_m.i 0.... ..."

### Table 1: Efficiency on vertex enumeration (continued)

"... In PAGE 24: ... It should be noted that strictly speaking, lrslib solves a slightly different, easier problem than the one solved by the other systems: while the latter guarantee the result is minimized, the output of lrslib may contain duplicate rays. Table1 : Efficiency on vertex enumeration input PPL New Polka PolyLib cddlib lrslib pd ccc4.e 0.... In PAGE 25: ...Table1 : Efficiency on vertex enumeration (continued) input PPL New Polka PolyLib cddlib lrslib pd tsp5.e 0.... ..."

### Table 1: Efficiency on vertex enumeration (continued)

"... In PAGE 24: ... It should be noted that strictly speaking, lrslib solves a slightly different, easier problem than the one solved by the other systems: while the latter guarantee the result is minimized, the output of lrslib may contain duplicate rays. Table1 : Efficiency on vertex enumeration input PPL New Polka PolyLib cddlib lrslib pd ccc4.e 0.... In PAGE 26: ...Table1 : Efficiency on vertex enumeration (continued) input PPL New Polka PolyLib cddlib lrslib pd project2_m.i 0.... ..."