### Table 1: The E(n; k) numbers.

1990

"... In PAGE 5: ... Let E(n; k) denote the set of elements of En for which 1 = k, and let E(n; k) denote the number of elements in E(n; k). See Table1 . There is a simple recurrence relation for the E(n; k) numbers as shown in the following lemma.... ..."

Cited by 2

### Table 4. e(n, r)

### Table 1 { E(N) vs. ~ E( ~ N).

"... In PAGE 11: ...11 Table1 shows examples comparing the unrestricted optimal policy with one described by Theo- rem 5.1, where xi = (1 ? ~ Ns)=( ~ N + 1), 1 i ~ N + 1, with ~ N optimal, i.... ..."

### Table 1: Nor mal Means M o del

1997

"... In PAGE 9: ...96 for both paramete rs or the next di scard ing woul d have resulted in fewer than 250 iterates being re tained (in whic h case th e sampler run was deem ed to ha ve fail ed to con verge an d no statistic s were stored). For eac h par am eter, th e firs t sec tion of Table1 pre sen ts th e an alyti call y compu ted pos teri or me an and widt h of the 95% HPD region. The next se ction shows th e mean across all 300 chain s of the sample m ean , the mean squar ed err or, and the width of th e... In PAGE 10: ... However, app lication of th e four version s of the diagn os tic result ed in di scard ing in itial iterati ons from 41 to 49 of the 300 chain s. Th e section of Table1 for eac h vers ion of the diagn os tic prese nts the means, MS Es, interval wid ths, and num ber of iterati ons retain ed average d over on ly those chains for wh ich som e in itial iterati ons were di scard ed. Th ere is no evid ence of syste matic up ward or down ward bias in the estimates of the means for eith er paramete r.... ..."

Cited by 16

### Table 3. Comparison between Diff-Greedy and EnTaS of Del- l apos;Amico and Ma oli [7]. Average cut sizes of EnTaS and percent di erences.

1997

"... In PAGE 16: ... Averages over 1000 runs, with standard deviation bars. Table3 reports the results of EnTaS in the rst columns, and the relative di erence between Diff-Greedy and EnTaS in the second (for 100 repetitions) and third column (for 1000 repetitions). In detail, these columns list the quantity 100 ( ^ fDiff-Greedy ? ^ fEnTaS)= ^ fEnTaS, ^ f being the average cut size.... In PAGE 17: ...17 for EnTaS. Nonetheless, the results in Table3 are useful for a rst comparison. It can be observed that the performance of Diff-Greedy tends to be within a few percent points for the random graphs, while it tends to be superior, in some cases by up to 50 - 60 % , for most geometric graphs.... ..."

Cited by 14

### Table 3 { E(n) vs. ~ E(n) for the Exponential Law. s = :1, maxima are in boldface. c = 1:0

"... In PAGE 15: ...1) and simpli cation yields ~ E(n) = c ? ns n + 1 e?c + e?(c+s)=(n+1) 1 ? e?(c+s)=(n+1)(1 ? e?n(c+s)=(n+1)) : (6.10) Table3 shows examples comparing E(n) and ~ E(n), as n increases up to the largest value for which ns + hn(0) c. While E(n) and ~ E(n) can di er substantially, we again see, as in the uniform case, that maxm 0 E(m) and maxm 0 ~ E(m) are quite close.... ..."

### Table 2: EnE Analysis Confusion Matrix

2004

Cited by 25