### Table 5: Parameters for enclosure construction.

1991

Cited by 10

### Table 5: Parameters of generalized Gray image of extended Hensel lift of QR(n) (left) and minimum distance of the best known linear codes of same length and size (right).

2003

"... In PAGE 6: ... Following this work, we lifted generating polynomial of QR(n) for n = 17, 23, 31, 47 to Z8 and Z16, extended the resulting codes by a parity-check sym- bol, then computed their minimum distance with computer assistance. Results are shown in Table5 , bold (resp. italic) is for codes better than (resp.... ..."

Cited by 1

### Table 7: Robustness results.

2004

"... In PAGE 30: ...We present another set of robustness results in Table7 . In the first column, we include the number of firms on the other standard as a third endogenous variable.... In PAGE 30: ... We re-estimate the model in column 2 of Table 5 but construct the likelihood value from only the 1909 observations that did not adopt at all in July.27 The results appear in column 2 of Table7 . The results are very similar to those estimated using all of the observations.... ..."

### Table 1: Average times for point-in-polygon tests (in microseconds), number of edges per polygon vs. method for random polygons.

1999

"... In PAGE 3: ... Tests were performed on a Sili- con Graphics Indy workstation with a 133 MHz IP22 CPU; all processes save system daemons were dis- abled during test execution to further minimize vari- ability of measurements. The results for the various methods are shown in Table1 . Only the half-plane method is faster (14%) for triangles than the CSG method using the simply- sorted heuristic described in Section 3.... In PAGE 6: ... More sophisticated heuris- tics are possible. Table1 illustrates that this heuristic (noted as the sorted variety) does improve average perfor- mance over the default permutation 0{20%, becom-... In PAGE 7: ...on size vs. cost metric. The four lines represent (from top to bottom) average maximum cost permu- tation, average default permutation, average simply- sorted heuristic permutation, and average minimum cost permutation. Data computed on 50 sample poly- gons used in Table1 for each of three through ten edges per polygon. gorithms described in this paper generalize to detect ray/polygon intersections in 3-space in a straightfor- ward way, once one is familiar with Pl ucker coordi- nates [14].... ..."

Cited by 2

### Table 3 Enclosure sizing in a

2007

"... In PAGE 15: ...evenly divisible by the blade enclosure height, and even if it cannot, there should be minimum waste on the left-over rack space. Table3 lists how well different enclosure sizes fit within a 42U rack. The 4U and the 5U are too small to accommodate modern high-performance server electronics and still provide space for the minimum number of blades to be compet- itive (listed in the last column).... ..."

Cited by 1

### Table 1. E ectiveness and robustness from (a) padded and (b) unpadded tests. Listed are the maximum and minimum robustness values for rotation angles of 4 , 8 , 30 , and 45 ; scaling factors of 5%, 10%, 15%, and 20%; and translations factors of 5%, 10%, and 15% of the image size.

"... In PAGE 5: ....2. E ectiveness The e ectiveness of a watermarking scheme is measured as the probability that the output of the watermark embedder will contain the watermark, subject to constraints on the delity of the marked image and the detection threshold or probability of false positive. The e ectiveness of the current scheme is measured and reported in Table1 (row labeled \E quot;). Improvements are possible in the approximate inversion of the log-polar resampling and in the distribution of the di erence signal to the log-polar coe cients.... In PAGE 7: ...tiveness is likely to be reduced in the padded examples since a portion of the watermarked image (the watermarked gray padding) has been replaced with non-watermarked data. However, the purpose of the experiments shown in Figure 2 (b)-(d) and reported in Table1 (a) is to isolate the e ects of geometric distortions from cropping e ects. The results of experiments that were based on the original, unpadded images are reported in Table 1 (b).... In PAGE 7: ... However, the purpose of the experiments shown in Figure 2 (b)-(d) and reported in Table 1 (a) is to isolate the e ects of geometric distortions from cropping e ects. The results of experiments that were based on the original, unpadded images are reported in Table1 (b). These tests include rotation with cropping, scaling up with cropping, translation with cropping, and scaling down.... In PAGE 7: ...1. The results shown in Table1 (a) are for RST distortions without cropping. We see that this algorithm is extremely robust to translation and shows very good robustness to rotation and scale up at moderate false positive rates.... In PAGE 7: ... We see that this algorithm is extremely robust to translation and shows very good robustness to rotation and scale up at moderate false positive rates. The algorithm is also extremely robust to scale down, the results of which are reported in Table1 (b) and are also free from cropping. Table 1(b) also shows the results of RST distortions with cropping.... In PAGE 7: ... The algorithm is also extremely robust to scale down, the results of which are reported in Table 1(b) and are also free from cropping. Table1 (b) also shows the results of RST distortions with cropping. The di erence between the translation results of the two tables reveals the sensitivity of this method to cropping.... ..."

### Table 6: Robustness of tournament sheets.

2005

"... In PAGE 16: ... That is, we will use one probability model to create a contrarian sheet, and see how it fares in ROI simulations performed under another model. Table6 gives the results, where rows correspond to true probability models and columns to the model used to derive the \optimal sheet. quot; This table can be read two difierent ways.... In PAGE 20: ... Table 10 contains the average ROI for this approach in its \predicted champion-only contrarian quot; columns. Comparing these results to Table6 gives an indication of how our predicted champion-only contrarian al- gorithm performs relative to the case where we know exactly how our opponents bet. In 58% of the cases, our algorithm obtained the same sheet as when we assume this knowledge, and therefore delivered an equal simulated ROI.... ..."

### Table 1 shows some characteristics of the models, which contain only major occluding features such as exterior walls. The table also shows time spent in octree construction and initialization (including occluder area-angle preprocessing).

1996

"... In PAGE 13: ...Input and Initialization Scene Polygon References Construction Initialization Initial Final (msec) (msec) Soda 1685 2971 160 510 City 2857 4722 270 480 Tetra 3601 4974 260 740 Table1 : The column Final denotes the total number of polygon references after octree construction. Construction shows the time spent in octree construction, and Initialization shows the time spent ini- tializing the algorithm to the rst viewpoint.... ..."

Cited by 12

### Table 1 shows some characteristics of the models, which contain only major occluding features such as exterior walls. The table also shows time spent in octree construction and initialization (including occluder area-angle preprocessing).

1996

"... In PAGE 14: ...Input and Initialization Scene Polygon References Construction Initialization Initial Final (msec) (msec) Soda 1685 2971 160 510 City 2857 4722 270 480 Tetra 3601 4974 260 740 Table1 : The column Final denotes the total number of polygon references after octree construction. Construction shows the time spent in octree construction, and Initialization shows the time spent ini- tializing the algorithm to the rst viewpoint.... ..."

Cited by 12

### Table 1. Construction time for BDDs using ITE

1996

"... In PAGE 2: ... Thusn2c a binary opn2d eration has the time complexityOn28jFjn01jGjn29. The inn0duence of the CT is shown in Table1 . One can observe that only a minority of the ISCASn2785 n5b3n5d benchmarks can be constructed as BDDs in approprin2d ate time without a CT.... ..."

Cited by 20