Results 1 - 10 of 52,698

Table 1. The recursive plan generation procedure

in Self-configuration of Network Devices with Configuration Logic
by Sylvain Hallé, Éric Wenaas, Roger Villemaire, Omar Cherkaoui

Table 1. Elapsed time (sec.) of segmentation processing (see Figure 6). MS+growth stands for the elapsed times for mean shift cluster- ing and chart growth procedures.

in Feature Sensitive Mesh Segmentation with Mean Shift
by Hitoshi Yamauchi, Seungyong Lee, Yunjin Lee, Yutaka Ohtake, Alexander Belyaev , Hans-Peter Seidel 2005
"... In PAGE 4: ... The same number of charts (Nc) was used for segmenting a model with different methods. The number of triangles of each model in Figure 6 and the pro- cessing time are shown in Table1 . The feature enhancing effects of Mean Shift are observed in many cases.... In PAGE 5: ... Our al- gorithm took about 30 seconds to 25 minutes to complete the segmentation. Table1 shows the details of the process- ing time. One problematic case for our approach is that the sur- face has no features.... ..."
Cited by 5

Table 3: Scheme on the recursive calls of the procedure Place-replica

in unknown title
by unknown authors

Table 2 Distribution of Shift (% of Eyes) in Manifest Refraction for Each Decade Subgroup Myopic Shift Hyperopic Shift

in Age-related Refractive Shifts in Simple Myopia
by Karen L. Ellingsen, Azhar Nizam, Bs Azhar Nizam, Ms Bruce, Bruce A. Ellingsen, Michael J. Lynn
"... In PAGE 3: ...nd +0.41 D (n = 88, SD = 0.48 D), respectively. Table2 presents the percentages of eyes with refractive shifts of 1 D or more, between 0.62 and 0.... ..."

Table 4.6: Procedure ShiftRows

in Cryptology course
by Christophe Ritzenthaler

Table 1 Shift in Manifest Refraction for Each Decade Subgroup Mean Age Mean Refraction Mean Mean Shift

in Age-related Refractive Shifts in Simple Myopia
by Karen L. Ellingsen, Azhar Nizam, Bs Azhar Nizam, Ms Bruce, Bruce A. Ellingsen, Michael J. Lynn
"... In PAGE 2: ...efractive shift was within 0.50 D and within 1.00 D were recorded. RESULTS Decade-by-decade Shifts in Manifest Refraction The decade-by-decade average shifts in manifest refraction are presented in Table1 . The eyes includ- ed in each decade subgroup were followed for approx- imately 10 years, except for the 88 eyes in the decade of the 60s, which were followed for an average of 7.... In PAGE 3: ...0s, a hyperopic shift of +1.28 D (SE = 0.14 D) (Figure). In comparison, the 10-year shifts observed in the sample for this paper ( Table1 ) were myopic shifts for each decade subgroup. Shift in Refraction between Ages 20 and 40 and between Ages 50 and 60 Mean shift in refraction for 115 eyes examined in their middle 20s and again in their middle 40s was Journal of Refractive Surgery Volume 13 May/June 1997 225 Age-related Refractive Shifts in Myopia/Ellingsen et al Table 1 Shift in Manifest Refraction for Each Decade Subgroup Mean Age Mean Refraction Mean Mean Shift ... ..."

Table 1: Evolution of Mean Shift Algorithm

in Robust Analysis of Feature Spaces: Color Image Segmentation
by Dorin Comaniciu , Peter Meer 1997
"... In PAGE 3: ...In Table1 the initial values and the nal location, shown with a star at the top of Figure 1, are given. The mean shift algorithm is the tool needed for fea- ture space analysis.... ..."
Cited by 130

Table 14 Index vector by recursion.

in Bit Reversal On Uniprocessors
by Alan H. Karp 1996
"... In PAGE 26: ... Elster instead uses the \add half quot; procedure which involves halving an integer instead of doubling an array. Table14 can be compared with Table 1 to see the di erence in the way the index vector is built. Since Elster apos;s approach never changes an entry once it has been computed, it saves arithmetic and time, as shown in Table 15.... ..."
Cited by 8

Table 1 Index Vector by Recursion

in Bit Reversal On Uniprocessors
by Alan H. Karp 1996
"... In PAGE 3: ... For example, weknow that the last n ; 2 bits of ~ k j are zero for k j lt; 4. This approach leads to the recursive algorithm illustrated in Table1 [42]. At eachstepwemultiply the currentlistby 2 and concatenate 1 plus the list.... In PAGE 26: ... Elster instead uses the \add half quot; procedure which involves halving an integer instead of doubling an array.Table 14 can be compared with Table1 to see the di erence in the way the index vector is built. Since Elster apos;s approach never changes an entry once it has been computed, it saves arithmetic and time, as shown in Table 15.... In PAGE 26: ... Since Elster apos;s approach never changes an entry once it has been computed, it saves arithmetic and time, as shown in Table 15. Elster apos;s algorithm and that in Table1 are both special cases of a more general formulation that comes from the idea of a tensor sum[33]. The tensor sum of two vectors w = u v is de ned as w =[u + v 0 ;;u+ v 1 ;; .... ..."
Cited by 8

Table 5: Root Mean Squared Forecast Errors relative to a linear AR model (where the parameters have been estimated recursively using expanding sam- ples)

in Structural breaks and long memory in US inflation rates: Do they matter for forecasting?
by Namwon Hyung, Philip Hans Franses
Results 1 - 10 of 52,698