Results 11 - 20 of 1,559

Table 3. Orthogonal scan statistics for benchmark circuits Orthogonal Scan

in High-Level Synthesis for Scan
by Gates A, R.B. Norwood, E.J. McCluskey
"... In PAGE 22: ...Table 4. Size of data path and control for benchmark circuits in cell units No Scan Traditional Scan Orthogonal ScanNormal Synthesis Orthogonal Scan ModifiedSynthesis Circuit DP Area ControlArea DP Area ControlArea DP Area ControlArea DP Area ControlArea diffeq 13206 198 14774 198 13686 222 13334 243 ellipf 10704 411 12048 411 11232 545 10992 507 tseng 10273 153 11393 153 10913 192 10945 174 scan path that modifies only three functional unit inputs, as shown in Table3 . The normal synthesis results in an orthogonal scan path that modifies four functional unit inputs, i.... ..."

Table 1: Orthogonalization of cluster bases

in Approximation of integral operators by H²-matrices with adaptive bases
by Steffen Börm 2004
"... In PAGE 18: ... In the first example, we apply the orthogonalization algorithm to an intermediate approximation constructed by cubic interpolation. The results of the experiment are reported in Table1 . The first and second column give the time for the construction of the approximation: The first column contains the total time in seconds, the second contains the time per degree of freedom in milliseconds.... ..."

Table 1: Finite polar spaces

in Notes on Classical Groups
by Peter J. Cameron 2000
Cited by 2

Table 2. Orthogonal Array [26]

in Ontological Intelligent Agent for Impulse Noise Removal
by Chang-shing Lee, Mei-hui Wang, Chin-yuan Hsu
"... In PAGE 7: ... The fourth group consists of randomized 1 a CS + 2 a CS part and randomized 1 b CS + 2 b CS part. Table2 illustrates an example of the orthogonal arrays. Generally, level 0 and level 1 of a factor represent the selected genes from parents 0 and parents 1, respectively.... ..."

Table 2: Properties of the eleven bosonic operators operator non-blind blind super-blind SU(2)c

in unknown title
by unknown authors
"... In PAGE 13: ...= (@ h b U b Uyi)(@ h b U b Uyi) ; (38) O 3 = h b U b Uyi3 : (39) As presented in Table2 , one can regroup the operators into sets which have basically di erent physical consequences and behaviours under certain symmetries. The rst four of them are called non-blind[34] because they involve 2-point gauge boson functions.... ..."

Table 4: Message Sizes for Blind Signatures

in Appendix H: WAVE/DSRC Security TABLE OF CONTENTS
by unknown authors
"... In PAGE 5: ...able 3: Summary of Environmental Constraints ......................................................................... 25 Table4 : Message Sizes for Blind Signatures .... In PAGE 63: ... In particular, it requires a periodic interactive exchange between OBUs and the CA. This exchange consists of two round trips with sizes shown in Table4 below. ... ..."

Table 3: Timings III: Blind Hand Problem

in Computing answers with model elimination
by Peter Baumgartner, Ulrich Furbach, Frieder Stolzenburg 1997
"... In PAGE 28: ... Again, OTTER has some problems and runs out of set of support with hyper-resolution while binary resolution does not find the desired answers concerning the examples #27 and #42. Look also at Table3 where some timings for the so-called Blind Hand problem are shown. The ver- sion number corresponds to that in the TPTP problem library.... ..."
Cited by 12

Table 4. The effect of blind feedback (BF)

in Tuning before feedback: Combining ranking discovery and blind feedback for robust retrieval
by Weiguo Fan, Ming Luo 2004
"... In PAGE 6: ...24 18 21 24 27 30 Number of terms MAP Rocchio KLD CHI Figure 4. Feedback methods on various feedback terms Table4 gives the performance comparisons between RF 1 and Okapi using Rocchio blind feedback method as shown in Equation (1) on the 150 old queries. All results are reported in terms of MAP.... In PAGE 6: ... All results are reported in terms of MAP. Only description queries and short queries results are reported here in Table4 . The performance improvement results on long queries using blind feedback are not reported because of lack of statistical significance.... In PAGE 7: ... The performance gain using both techniques is almost the sum of the gains by applying the individual techniques alone. Our results on the 150 old queries in Table4 show that combining ranking function tuning and blind feedback can improve the search performance by almost 30% over the baseline Okapi system. This is very encouraging considering the fact that most ad hoc search queries are very short and many of these queries are repetitive.... ..."
Cited by 3

Table 3: Timings III: Blind Hand Problem

in Computing Answers with Model Elimination
by Peter Baumgartner, Ulrich Furbach, Frieder Stolzenburg
"... In PAGE 28: ... Again, OTTER has some problems and runs out of set of support with hyper-resolution while binary resolution does not find the desired answers concerning the examples #27 and #42. Look also at Table3 where some timings for the so-called Blind Hand problem are shown. The ver- sion number corresponds to that in the TPTP problem library.... ..."

Table 2: Performance gain from blind feedback.

in A Hidden Markov Model . . .
by David R. H. Miller, et al.
"... In PAGE 5: ... s.t. D is rel. to Q i ;; w 2 I m;;Q i ;; df (w)=x : (10) Blind feedback produced a large and robust perfor- mance improvement(see Table2 ). Weusedthe top 6 documents from the rst retrieval to form m-intersections.... ..."
Results 11 - 20 of 1,559