Results 1 - 10
of
17,285
Table 10: Number of Video Flows Accepted in Various Scenarios (multiple congested Link; heteroge- neous video)
2002
"... In PAGE 18: ...2.1 Number of Video Flows Recovered Table10 shows the number of video flows accepted in each traffic group. In Traffic Group 1, 9 video flows are accepted under WFQ (but they are unintelligible flows).... In PAGE 18: ... For WFQ++(RS) and WFQ++(LBS), the number of accepted video flows is 3 and 5 respectively. Table10 suggests that LBS has a better performance than RS. Timeline of video flow recovery is shown in Table 11.... ..."
Table 10: Confusion matrix and correspondence of data maps of CFBE in heteroge- neous setting.
"... In PAGE 15: ... Then, according to the confusion matrix of the data maps, we can easily derive the map. Table10 presents the confusion matrix and its correspondence. The outcome of the D-CoFD-Het algorithm is shown in Table 11 and the recovering rate in this case was BCBMBLBKBE.... ..."
Table 3.1: Compound symmetric structure for both the homogeneous and heteroge- neous covariance matrices
2007
Table III. Average stretch for heteroge- neous platforms, relative to the scheme us- ing no redundant requests, averaged over 50 experiments, for N = 10 clusters.
Cited by 1
Table 1: Roundtrip times in microseconds between di erent types of workstations in a heteroge- neous network. (Entries with * indicate that the sender and receiver were in di erent clusters.) HP 735 HP 715/100 HP 715/64 Sun4
1998
"... In PAGE 6: ... Similarly, let the other four (1, 4, 7, and 8) be fast ones and have lower message initiation cost, tf ini. Based on our experimental data ( shown in Table1 ) , it can be observed that the ts ini=tf ini can be as large as 5. For an example quantitative evaluation, let us consider tf ini = 100.... ..."
Cited by 45
Table 1: Roundtrip times in microseconds between di erent types of workstations in a heteroge- neous network. (Entries with * indicate that the sender and receiver were in di erent clusters.) HP 735 HP 715/100 HP 715/64 Sun4
1998
"... In PAGE 7: ... Similarly, let the other four (1, 4, 7, and 8) be fast ones and have lower message initiation cost, tf ini. Based on our experimental data ( shown in Table1 ) , it can be observed that the ts ini=tf ini can be as large as 5. For an example quantitative evaluation, let us consider tf ini = 100.... ..."
Cited by 45
Table 2 Definition of heterogeneous network Network
"... In PAGE 2: ... That is, the fourth generation wireless network should be a heterogeneous network that supports multiple broadband wireless access technologies and global roaming across the systems constructed by individual access technologies. Table2 gives a definition of heteroge- neous network. Table 2 Definition of heterogeneous network Network ... ..."
Table 2: Timing for temperature dataset (times in min) In Tables 1 and 2, Size is the size of the nal ren- dered image, Proc is the number of processors, Time is the total time to render the image, is the e ciency, and is the load balance measure. The e ciencies were calculated using a base-line of two processors, since there is an integration node and a combining node. As such, the factor used for calculating the ef- ciences would always be Proc ? 1. We feel that this method gives a better measure of scaling for heteroge- neous, asynchronous algorithms, since using the raw number of processors incorrectly leads to predictions of super-linear speedup.
"... In PAGE 4: ... This dataset size was 180 360 30, which is 2M voxels. The results for this test dataset are shown in Table2 . The Tables contain a range of rendered image sizes from 128 128 to 512 512 pix- els.... ..."
Tables 2, 3 and 4 compare the baseline results and global clustering on TREC3, TREC4 and TREC6. Ten collections were searched per query in the experiments. Each collection was represented as a language model. The collection selec- tion metric is the Kullback-Leibler divergence. The results show that the baseline distributed retrieval with heteroge- neous collections is signi cantly worse than centralized re- trieval, around 30% at all document cut-o s on all three test sets. But when collections are created based on topics, the performance of distributed retrieval is close to centralized retrieval on all three test sets. On TREC4, global clustering is even better than centralized retrieval at document cut- o s 5 and 10. The t-test [12] shows the improvement over
1999
Cited by 106
Table 6: Kappa statistics for the individual questions and overall assessment.
"... In PAGE 16: ...questions are shown and their implications discussed below. Results The following results (see Table6 ) were computed for the kappa statistic, one for each of the individual question-specific datasets and one for the overall aggregated dataset. Table 6: Kappa statistics for the individual questions and overall assessment.... ..."
Results 1 - 10
of
17,285