### Table 7 Comparison of dual SB-trees and JSB-trees.

"... In PAGE 15: ... As a complete example, Figure 20 in the appendix shows the sequence of snapshots of the JSB-tree for cumulative BTCEBZ aggregates over C8D6CTD7CRD6CXD4D8CXD3D2 as tuples are inserted in the or- der listed in Table 1; Figure 21 shows the sequence of snap- shots as tuples are deleted in the reverse over. Discussion A comparison between dual SB-trees and JSB- trees is shown in Table7 . Although these two approaches have the same asymptotic complexity, JSB-trees appear to be more efficient than dual SB-trees because JSB-tree operations typically traverse fewer number of paths.... ..."

### Table 7 Comparison of dual SB-trees and JSB-trees.

"... In PAGE 15: ... As a complete example, Figure 20 in the appendix shows the sequence of snapshots of the JSB-tree for cumulative BTCEBZ aggregates over C8D6CTD7CRD6CXD4D8CXD3D2 as tuples are inserted in the or- der listed in Table 1; Figure 21 shows the sequence of snap- shots as tuples are deleted in the reverse over. Discussion A comparison between dual SB-trees and JSB- trees is shown in Table7 . Although these two approaches have the same asymptotic complexity, JSB-trees appear to be more efficient than dual SB-trees because JSB-tree operations typically traverse fewer number of paths.... ..."

### Table 4.8: ML Mixed Gaussian Parameter Estimates and RMS Error in Amplitude Dual Tree Complex Wavelet Analysis for Log Transformed Images

in Speckle Noise Reduction via Homomorphic Elliptical Threshold Rotations in the Complex Wavelet Domain

### Table 4: Percentage for VddL nets and VddL logic blocks given by dual-Vdd assignment under zero delay-increase (VddH = 1.5v and VddL = 1.0v).

"... In PAGE 3: ... Therefore a routing tree is a natural granularity in dual-Vdd assignment as we do not need to change Vdd level inside the routing tree. Table4 shows that an average of 54.54% routing trees can be assigned with VddL without degrading system performance if there is no layout constraint, i.... ..."

### Table 1: Benchmarks and Timings: Results for BVH ray tracing of several scenes. The benchmark con guration for each of the scenes is described in section 5. All benchmarks were performed at 5122 resolution on a dual-core P4 machine at 2.8GHz using 8x8 ray packet traversal and secondary rays (shadows and re ections). Performance numbers are given as an average over the whole animation, tree build times are for the spatial median build.

2006

"... In PAGE 3: ... The time complexity of this approach is O(n), which is lower than the construction method. This is re ected by update times that we have found to be about 4 times faster than rebuilding the tree for our benchmark models (see Table1 for detailed results). There- fore, we rely on hierarchy update operations to maintain interactive performance for dynamic environments.... ..."

Cited by 25

### Table 1: C4BD approximation error of single node marginals for the fully connected graph C3BL and the 4 nearest neighbour grid with 9 nodes, with varying potential and coupling strengths B4CSpotBN CScoupB5. Three different variational methods are compared: MF/Tree derives a lower bound with mean field approximation for A8BV and tree-reweighted belief propagation for A8; MF/SDP derives a lower bound with the SDP relaxation used for A8; Tree/MF derives an upper bound using tree- reweighted belief propagation for A8BV and mean field for A8. SDP denotes the heuristic use of the dual parameters in the SDP relaxation, with no provable upper or lower bounds.

2004

"... In PAGE 7: ... To assess the accuracy of each approximation, we use the C4BD error, defined as BD D2 D2 CG D7BPBD CYD4AIB4CG BE BVB5 A0 CQ D4AIB4CG BE BVB5CY (36) where CQ D4AI denotes the estimated marginal. The results are shown in Table1 for the single node case, and in Table 2... ..."

Cited by 6

### Table 1. Run time studies for PT server generation, automated alignment and parsimony-based treeing

2004

"... In PAGE 8: ... However, ARB is also routinely used on laptops or older PCs and workstations with less memory and monitors with lower resolution. Table1 gives some information on processing times for some of the major functions in ARB: generation of the PT server, automated sequence alignment and phylogenetic treeing. Run-time measurements were performed on a dual- processor (Intel Xeon , 2.... ..."

Cited by 9

### Table 5 Average{absolute error of LS TreeBoost, LAD TreeBoost, and M TreeBoost on the demographic data for varying numbers of terminal nodes in the individual trees. Term. nodes LS LAD M

2001

"... In PAGE 28: ... Var Demographic #values Type 1 sex 2 cat 2 martial status 5 cat 3 age 7 real 4 education 6 real 5 occupation 9 cat 6 income 9 real 7 years in BA 5 real 8 dual incomes 2 cat 9 number in household 9 real 10 number in household lt;18 9 real 11 householder status 3 cat 12 type of home 5 cat 13 ethnic classi cation 8 cat 14 language in home 3 cat We illustrate TreeBoost on these data by modeling income as a function of the other 13 variables. Table5 shows the average{absolute error in predicting income, relative to the best constant predictor (51), for the three regression TreeBoost algorithms.... ..."

Cited by 197