CiteSeerX — Table search results

Results 1 - 10 of 22,422

TABLE II Definitions of new parametersused in the full version of CIF-Q.

in Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors

by unknown authors

Table 2. Full and partial parsing (VERSION 4).

by Sylvain Delisle , Elizabeth Scarlett, Stan Szpakowicz

"... In PAGE 11: ... In general, DIPETT manages to parse at least 95% of any English text, just with varying proportion of full parses. For the last five texts from Table 1, partial parsing performed in addition to the full parses listed, gives the results shown in Table2 . That is, DIPETT parsed between 91% and 99% of these texts.... ..."

TABLE II Definitions of new parameters used in the full version of CIF-Q.

in Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors

by unknown authors

Table 1: Results of experiments EP/N without EP/N Detour and Short-cut (full version)

in Evolutionary Algorithms and the Problem-Specific Knowledge

by Krzysztof Trojanowski, Zbigniew Michalewicz

TABLE 3. Average Total Persons and Usual Residents quot;FULL quot; Version 1 vs Version 3

in Coverage Improvement From Experimental Residence Questions

by Anne T. Kearney, Roger Tourangeau, Gary Shapiro 1993

Cited by 2

Table 9. Reduction on computing time using the combination method in comparison to the full grid version using a various number of workstations on the second test case.

in A comparison between different parallelization methods on workstation clusters to solve CFD-problems

by W. Huber

"... In PAGE 8: ...Table9 . Here, we compute S(P) = execution times of full grid version on P workstations execution times of the combination method on P workstations:... In PAGE 8: ... Reduction on computing time using the combination method in comparison to the full grid version using a various number of workstations on the second test case. Table9 shows the reduction of the total execution time by using the combination method. The advantage of using the combination method increases by increasing the number of used grids.... In PAGE 8: ... It mentioned before, that the used time step on the di erent grids has great in uence on the run times. So, using an implicit time discretization the values in Table9 will be smaller. 7 Conclusion In this paper, we compared di erent parallelization strategies to simulate incompressible laminar uid ows.... ..."

TABLE II COMPARISON BETWEEN THE FULL-FLEDGED VERSION OF THE PROPOSED ALGORITHM, TWO PARTIAL VERSIONS OF THE PROPOSED ALGORITHM, AND THE STATIC CLUSTERING ALGORITHM UNDER SQUARE DEPLOYMENT AND THE ASSUMPTION THAT NOISE CAN BE IGNORED.

in Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Networks

by Wei-Peng Chen Jennifer

Table 1: Landmark repeatability experiment. The original landmark method is compared to three versions of the new ERPR method: the full iterative refinement; the simplified version with one step of back trace refinement; and an even simpler version with no back trace refinement whatsoever.

in Model-based method for improving the accuracy and repeatability of estimating vascular bifurcations and crossovers from retinal fundus images

by Chia-ling Tsai, Charles V. Stewart, Howard L. Tanenbaum, Badrinath Roysam, Prof Badrinath Roysam 2004

"... In PAGE 9: ... By combining these measures over all landmarks in all registered image pairs, we obtain summary statistics on the repeatability of the estimated landmark parameters. Table1 shows summary statistics for the original landmark detection technique and for several versions of the proposed ERPR technique, including the full method, the simplified method using just one iteration of back trace refinement, and a version where back trace refinement is not used at all. Clearly, the ERPR method is twice as repeatable as the original method, both in terms of position and orientation.... ..."

Cited by 6

Table 1: Landmark repeatability experiment. The original landmark method is compared to three versions of the new ERPR method: the full iterative refinement; the simplified version with one step of back trace refinement; and an even simpler version with no back trace refinement whatsoever.

in Model-Based Method For Improving The Accuracy And Repeatability Of Estimating Vascular Bifurcations And Crossovers From Retinal Fundus Images

by Chia-ling Tsai, Charles V. Stewart, Howard L. Tanenbaum, Badrinath Roysam 2004

"... In PAGE 14: ... By combining these measures over all landmarks in all registered image pairs, we obtain summary statistics on the repeatability of the estimated landmark parameters. Table1 shows these summary statistics for the original landmark detection technique and for several versions of our new ERPR technique, including the full method, the simplified method using just one iteration of back trace refinement, and a version where back trace refinement is not used at all. Several conclusions are immediately apparent.... ..."

Cited by 6

Table 3 Hardware specifications The specifications regard our implementation. Other boards can be also used depending on the experimental requirements. Instead of the LabVIEW Professional Version also the Full Version can be used. LabVIEW and the PXI components are available from National Instruments Corp. (Austin, Texas, U.S.A.)

in unknown title

by unknown authors

"... In PAGE 13: ... This allows a time synchronized analog data acquisition at constant intervals. Table3... ..."

Results 1 - 10 of 22,422

Tools

TABLE II Definitions of new parametersused in the full version of CIF-Q.

Table 2. Full and partial parsing (VERSION 4).

TABLE II Definitions of new parameters used in the full version of CIF-Q.

Table 1: Results of experiments EP/N without EP/N Detour and Short-cut (full version)

TABLE 3. Average Total Persons and Usual Residents quot;FULL quot; Version 1 vs Version 3

Table 9. Reduction on computing time using the combination method in comparison to the full grid version using a various number of workstations on the second test case.

TABLE II COMPARISON BETWEEN THE FULL-FLEDGED VERSION OF THE PROPOSED ALGORITHM, TWO PARTIAL VERSIONS OF THE PROPOSED ALGORITHM, AND THE STATIC CLUSTERING ALGORITHM UNDER SQUARE DEPLOYMENT AND THE ASSUMPTION THAT NOISE CAN BE IGNORED.

Table 1: Landmark repeatability experiment. The original landmark method is compared to three versions of the new ERPR method: the full iterative refinement; the simplified version with one step of back trace refinement; and an even simpler version with no back trace refinement whatsoever.

Table 1: Landmark repeatability experiment. The original landmark method is compared to three versions of the new ERPR method: the full iterative refinement; the simplified version with one step of back trace refinement; and an even simpler version with no back trace refinement whatsoever.