Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
24,634
TABLE 3 Selectional Restrictions Imposed on the NP Foot Node by Groups of Determiners/Determiner Constructions
2000
Cited by 7
Table 2: Calculation time of the repositioning of the cow foot in seconds.
2001
"... In PAGE 6: ... Therefore, we implemented a memory manager that minimized the memory page swapping. In Table2 several timings for the optimization process can be seen. Here, some calculations for the broken cow foot are presented using breadth-first traversal, whereas the number of iterations strongly depends on the quality of the manual adjustment.... ..."
Cited by 1
Table 2: Calculation time of the repositioning of the cow foot in seconds.
2001
"... In PAGE 6: ... Therefore, we implemented a memory man- ager that minimized the memory page swapping. In Table2 several timings for the optimization process can be seen. Here, some calculations for the broken cow foot are presented using breadth-first traversal, whereas the number of iterations strongly depends on the quality of the manual adjustment.... ..."
Cited by 1
Table 2: Calculation time of the repositioning of the cow foot in seconds.
2001
"... In PAGE 6: ... Therefore, we implemented a memory man- ager that minimized the memory page swapping. In Table2 several timings for the optimization process can be seen. Here, some calculations for the broken cow foot are presented using breadth-first traversal, whereas the number of iterations strongly depends on the quality of the manual adjustment.... ..."
Cited by 1
Table 3: Cost Per Square Foot of Renovation Reported in this Survey
2005
"... In PAGE 11: ... Adaptive Reuse and Renovation Projects Identified 7 Table 2. Cost of New Construction 8 Table3 . Cost Per Square Foot of Renovation Reported in this Survey 12 Table 4.... In PAGE 19: ...han 50,000 sq. ft.) was arrived at in consultation with architects. The information was then placed in a 9 cell matrix indicating residential, commercial and institutional type properties in each of the three categories, small, medium and large ( Table3 ). Two of the cells, small residential and large institutional, remain blank since in the first case Table 1: Projects Identified Small: lt;18000 sq.... ..."
Table 1. Iterative construction of a multiplicity matrix
2003
"... In PAGE 14: ... Suppose we restrict the cost of the multiplicity matrix to 14, that is, we wish to nd M( ; 14) = argmaxM2M(14) hM; i We construct a multiplicity matrix M by a greedy iterative process, starting with the 5 5 all-zero matrix, and requiring at each iteration that the newly chosen interpolation point maximizes the increase in the expected score normalized by the number of additional linear constraints (the increase in cost). Table1 shows the sequence of chosen interpolation points. Observe that the column that contains the ratio of the increase in the expected score to the increase in cost is strictly de- creasing.... In PAGE 17: ... Henceforth, let (is; js) denote the position updated at iteration s of Algorithm A, and consider the sequence of ratios of the increase in the expected score to the increase in cost at successive iterations of Algorithm A (cf. the fourth column of Table1 ), namely 1 def= i1;j1 mi1;j1(1) ; 2 def= i2;j2 mi2;j2(2) ; 3 def= i3;j3 mi3;j3(3) ; It follows from (26) that the sequence 1; 2; : : : is non-increasing. (Indeed, this was our goal in the design of Algorithm A.... ..."
Cited by 67
Table 9: System Construction, Iteration 3 9a: Results of Iteration
2000
"... In PAGE 5: ...able 8: System Construction, Iteration 2......................................................................................................... 8 Table9 : System Construction, Iteration 3.... In PAGE 15: ...In the third iteration ( Table9 ), c7 is the first to be considered for addition to the baseline system. The alternative system formed when c7 is added meets all conditions for feasibility.... ..."
Table 8: System Construction, Iteration 2 8a: Results of Iteration
2000
"... In PAGE 5: ...able 7: System Construction, Iteration 1......................................................................................................... 6 Table8 : System Construction, Iteration 2.... In PAGE 13: ... (_,0,0,-1) d=0.620 (-) F 2 x (_,-1,-1,-1) (-) x4 (_,-1,0,0) 3 x (_,0,0,0) (_,0,-1,0) s0(+5) s0(+8) s0(+4)s0(+3) s0(+1) s0(+2) s0(+7) s0(+6) Figure 2: System Construction, Iteration 1 In iteration 2 ( Table8 ), the process of iteration 1 repeats. Alternative systems are formed combining c6 successively with the remaining alternative components.... ..."
Table 1: Application Characteristics In any application-based experimental evaluation the input data sets can be as important as the applications themselves. In each case we attempted to use realistic data sets that accurately re ected the way the applications would be used in practice. The data set for Water consists of 1728 molecules distributed randomly in a rectangular volume. It executes 8 iterations, with two parallel phases per iteration. These performance numbers omit an initial I/O and compution phase. In practice the computation would run for many iterations and the amortized cost of the initial phase would be negligible. The data set for String is from an oil eld in West Texas and discretizes the 185 foot by 450 foot velocity image at a 1 foot by 1 foot resolution. It executes six iterations, with one parallel phase per iteration. The performance numbers are for the entire computation, including initial and nal I/O.
1995
Cited by 1
Table 1: Iterated Voronoi computations; time in secs. (construction/total)
2000
"... In PAGE 8: ... To keep the comparison between lazy construction in LOOK and the im- mediate exact arithmetic construction in the RatKernels fair, we always skipped the construction of the circumcenters in the last iteration. Table1 shows the results for different num- bers of iterations. We give both, the total running time and the time spent for constructing the circumcenters.... ..."
Cited by 14
Results 1 - 10
of
24,634
