### Table 1: Probabilities of constraint violation and Chernoff approximations.

1997

"... In PAGE 7: ...e., P(Dp 0:9n): Table1 exhibits some results for this setup, where both the length n of the path and the mean m of the edge delays are varied. When m = 1=2 and the path is relatively long, say n = 20;;80 the probability of failure are O(10;4) and O(10;14) respectively, possibly small enough to be neglected.... In PAGE 7: ...ounds, e.g., 75 % smaller when m = 1=4, then probabilistic constraints are likely to allow a significant relaxation over the worst case critical path. The failure probabilities in Table1 were computed exactly based on Bernoulli distributions and via the Chernoff bound used by our algorithm. Clearly the results compare favorably, and as expected the Chernoff bound gives an upper bound on the failure probability.... ..."

Cited by 3

### Table 1: Probabilities of constraint violation and Chernoff approximations.

1997

"... In PAGE 7: ...e., P(Dp 0:9n): Table1 exhibits some results for this setup, where both the length n of the path and the mean m of the edge delays are varied. When m = 1=2 and the path is relatively long, say n = 20;80 the probability of failure are O(10?4) and O(10?14) respectively, possibly small enough to be neglected.... In PAGE 7: ...ounds, e.g., 75 % smaller when m = 1=4, then probabilistic constraints are likely to allow a significant relaxation over the worst case critical path. The failure probabilities in Table1 were computed exactly based on Bernoulli distributions and via the Chernoff bound used by our algorithm. Clearly the results compare favorably, and as expected the Chernoff bound gives an upper bound on the failure probability.... ..."

Cited by 3

### Table 2. Chernoff bound and empirical estimate of a209 a40 a32 a6 a117

"... In PAGE 4: ... Here we give results for Bottleneck link detec- tion We define a bottleneck as the event that the probability of a link delay exceeding some delay threshold a208 exceeds a prespecified threshold a209 . By the Chernoff bound, a209 a40 a32 a6a105a117a67a208 a44a211a210 a53 a119 a54a73a212 a49a77a76a78a53 a54 a58 a59a122a79 a12a68a209a21a6a88a18 (13) By appropriately selecting the threshold a208 and a threshold a209 close to 1, we can detect a bottleneck link by testing whether a213a171a214a114a215 a6a36a100a25a101a41a216a33a217a33a217a33a217a65a216 a99 a209a110a6a219a218a220a209 In Table2 , we show the Chernoff bounds for a209 a40 a32 a6 a117a221a208a164a12a219a202a222a18 a202 a182a17a223 a44 which were estimated from the computer simulation in Section 4. By setting threshold a209 to be 0.... ..."

### TABLE VI1 BOUNDS, APPROXIMATION, AND CHERNOFF BOUND FOR K=3ANDN=127(J=12,M=16;J apos;=16,~=12)

in Error Probability for Direct-Sequence Spread-Spectrum Multiple-Access Communications-Part I: Upper

### TABLE VI1 BOUNDS, APPROXIMATION, AND CHERNOFF BOUND FOR K=3ANDN=127(J=12,M=16;J apos;=16,~=12)

in Error Probability for Direct-Sequence Spread-Spectrum Multiple-Access Communications-Part I: Upper

### Table 1. Average total number of simulation replications and P{CS} by using Chernoff bounds (n0 = 10 and D =

1997

"... In PAGE 4: ... Different confi- dence level requirements are also tested. Table1 contains the test results using a Chernoff bound approach (Chen et al. 1996).... In PAGE 4: ...43 0.981 From Table1 and Table 2, we observe that the per- formances of the two approaches are not much different for small P* (e.... ..."

Cited by 16

### Table 1. XML Schema graphic model Graphic XML Schema

2005

"... In PAGE 2: ... 3 An XML Schema for SLSs As XML Schemas tend to be very verbose, a graphical notation is used to represent the structure, types, elements and content models of documents. Table1 illustrates all graphics used to model the SLS XML Schema. 1An SLA may include multiple SLSs, however, an SLS is usually re- lated to a service class usage.... ..."

Cited by 3

### Table 2.2: Bounds on variation of the hatches.

2007

"... In PAGE 44: ...Table2 deal more with the bounds of the variation of the hatches. Examples include the minimum and maximum number of rows and columns of hatches or the extents of how far a hatch can be rotated from its normal direction.... ..."

### TABLE II Minimax Chernoff criterion for coder selection.

### Table 5: Results for Gaussian variation sources.

2007

"... In PAGE 6: ... We also compare n2SSTA with our implementation of [2] (denoted as linSSTA) by assuming Gaussian variations and linear delay model for both. From Table5 , we see that in predicting = , n2SSTA matches Monte Carlo simulation well with about 5.5% error, while linSSTA has about 11% error.... In PAGE 6: ... This clearly shows that n2SSTA is not only more general, but also more accurate than linSSTA. Note that n2SSTA has a larger error for Gaussian variation sources in Table5 than for uniform or triangle variation sources in Table 4, and this is because n2SSTA needs bigger bounds (10) for Gaussian variations than for uniform or triangle variations. Interestingly, we nd that both approaches pre- dict the 95% yield point well.... ..."

Cited by 1