### Table 3: A game with non-degenerate minimal curb set

### Table 1. The eight possible homotopy class changes in 3-D at a non-degenerate critical point.

1998

Cited by 19

### Table 4.3: The coordinates of a feasible non- degenerate solution. See Figure 2.1 for a drawing of the two factors

2004

Cited by 2

### Table 3: 95% con dence level limits for the chargino mass and the corresponding pair production cross-sections at 172 GeV for the non-degenerate and a highly degenerate scenarios. The cases of a stable ~ 0 1 and ~ 0 1 ! ~ G , as well as a light (41 GeV=c2 lt; m~ lt; 100 GeV=c2) and a heavy (m~ gt; 300 GeV=c2) sneutrino, are considered.

"... In PAGE 13: ...t LEP 1 [20] mentioned in section 4.7 and discussed in section 5.2.1. For each ( ,M2) combination the number of single-photon events compatible with M~ 0 1 and M~ 0 2, the num- ber expected from the Standard Model background, and the energy-dependent e ciency were used in order to establish an upper limit on the cross-section times branching ratio, excluding certain MSSM parameter combinations. The chargino mass limits are summarized in Table3 . The table also gives, for each case, the minimum MSSM cross-section excluded by the requirement that M~ 1 be above the appropriate limit.... ..."

### Table 3: Numbers of vertices possible in non-degenerate axial transportation polytopes

709

### Table 8.6: Restrictions for di erent techniques Non-degenerate Simple Close

### Table 5. Conditional output probabilities from partial consumer mapping. The importance of the distinction can be demonstrated by running ID3 on the training set for the consumer problem shown above. ID3 is able to exploit the incidental e ects in the production of a non-degenerate decision tree, see Figure 4. However, because the e ects are non-generalising, the generalization performance turns out to be as bad as it could be. The decision tree actually produces the wrong output in all four cases (i.e., it yields 100% generalization error).

1996

Cited by 10

### Table 7.3. Known families of smooth, non-degenerate, non general type 3-folds in P5 X d

### Table 2. Synthetic test, results for 1000 random all- inlier samples. For ND algorithms all hypotheses are assumed non-degenerated.

### Table 4: Number of cycles in the bad case (56) (column 2), and observed number of cycles (column 3).

1992

"... In PAGE 39: ... Fortunately, numerical tests with randomly chosen examples show a much milder increase, which is approximately linear in n. Table4 compares the values (57) with the average observed values of the number of cycles, for Version B of the algorithm, in the non-degenerate case.... ..."