### Table 6: The evolution of the Internet at the inter-domain level.

1999

Cited by 780

### Table 1: Domains and levels of information for use in utterance disambiguation

2004

"... In PAGE 2: ... Secondly, relevant information can come from di erent domains, of which we consider three prominent ones: the world, the speaker model, and the dialogue context. Domains and levels of information are roughly orthogonal; Table1 summarizes their... ..."

Cited by 1

### Table 1. Categorization of the existing systems Category Indexing Resource-level Domain-level Index Data Supporting System Indexing Indexing Location Resource Type

"... In PAGE 6: ... Casual users will wait for eager users to annotate, and read documents based on their reviews. Table1 summarizes the categorization of existing systems by how the systems support domain-level indexing. 3.... ..."

### Table 4: Internet prediction assuming linear node increase. We predict the number of edges and e ective diameter of the Internet at the inter-domain level at the beginning of each year.

1999

"... In PAGE 10: ... We can assume that the number of nodes increases a) linearly, or b) by 1:45 each year. The results our shown in Table4 for the linear growth and Table 5 for the 1:45 growth. Given the number of nodes, we calculate the num- ber of edges using Lemma 2 with rank exponent of ?0:81, which is the median of the three observed rank exponents.... ..."

Cited by 780

### Table 4: Results for initial fractal block coding in the wavelet domain. Level 2 to Level 1, domain block size 4, 4-block radius search, basis projection not enabled.

"... In PAGE 31: ... Level 2 to Level 1, domain block size 4, no search, basis projection enabled. Table4 the e ects of enabling a 4 block radius search and gure 15 shows the rate distortion curve. Table 5 shows the e ect of the coe cient rate value on a system where the wavelet quantisation rate is held constant ( at 32 in this case), no search and the basis projection enabled.... ..."

### Table 5: Results for initial fractal block coding in the wavelet domain. Level 2 to Level 1, domain block size 4, no search, basis projection enabled.

"... In PAGE 31: ... Table 4 the e ects of enabling a 4 block radius search and gure 15 shows the rate distortion curve. Table5 shows the e ect of the coe cient rate value on a system where the wavelet quantisation rate is held constant ( at 32 in this case), no search and the basis projection enabled. Figure 17 shows the rate/distortion curve for the basic coder with no basis projection, with and without searching enabled.... ..."

### Table 4: Internet prediction assuming linear node increase. We predict the number of edges and e ective diameter of the Internet at the inter-domain level at the beginning of each year.

"... In PAGE 10: ... We can assume that the number of nodes increases a) linearly, or b) by 1:45 each year. The results our shown in Table4 for the linear growth and Table 5 for the 1:45 growth. Given the number of nodes, we calculate the num- ber of edges using Lemma 2 with rank exponent of ?0:81, which is the median of the three observed rank exponents.... ..."

### Table 5: Execution time on the 333 MHz Pentium Pro ASCI Red machine for function evaluations only for the 2.8 million vertex case, showing differences in exploiting the second processor sharing the same memory with both OpenMP instruction-level parallelism (number of subdomains equals the number of nodes) and MPI domain-level parallelism (number of subdomains is equal to the number of processes per node).

2000

"... In PAGE 12: ... This phase takes over 60% of the execution time and is an ideal candidate for shared-memory parallelism because it does not suffer from the memory bandwidth bottleneck. In Table5 , we compare the performance of this phase when the work is divided by using two OpenMP threads per node with the performance when the work is divided using two independent MPI processes per node. We note that there is no communication in this phase.... ..."

Cited by 9