### Table 2. Small world properties of giant components in public web services.

"... In PAGE 11: ... Therefore, the more distinct the small world prop- erties of a network are, the bigger IndexSN of the network becomes. Table2 shows the average shortest path, L and clustering coefficient, C for giant components extracted from each of the 25 web service networks, compared to random graphs with the same number of nodes and average number of edges per node. Note that we treat all edges of each network as undirected and un- weighted3.... ..."

### Table 2: Index properties of Pizza amp;Chili indexes.

### Table 1 Properties of algorithms to construct index structures.

"... In PAGE 3: ... Thus, the structure (suffix tree or CDAWG) has to be rebuilt from scratch, when a new character is added to the input string. Table1 summarizes some properties of typical algorithms to construct index structures. As seen there, a missing piece, which we have been looking for, is an on-line algorithm for constructing CDAWGs.... ..."

### Table 2. Comparison of Episode-Based Index, BLS MCPI, Large-Sample Index, and Small- Sample Index

2004

### Table 1. Index series of small species and their corresponding symmetric functions

2007

"... In PAGE 3: ... Essentially, this series counts the objects with no internal symmetry. Table1 contains some small examples of both series. 1This is interestingly enough not equivalent to D-finiteness with respect to either the h or e basis.... In PAGE 5: ...ulti-graphs. The sets of pairs indicate edges, and the colours indicate vertices. 4Species which can be written as polynomials of molecular species. For example, every species in Table1 is polynomial.... ..."

### Table 1. Index series of small species and their corresponding symmetric functions

2007

"... In PAGE 3: ... Essentially, this series counts the objects with no internal symmetry. Table1 contains some small examples of both series. 1This is interestingly enough not equivalent to D-finiteness with respect to either the h or e basis.... In PAGE 5: ...ulti-graphs. The sets of pairs indicate edges, and the colours indicate vertices. 4Species which can be written as polynomials of molecular species. For example, every species in Table1 is polynomial.... ..."

### Table 1: Index series of small species and their corresponding symmetric functions

### Table 2: Splitting/posting algorithm comparison Property Splitting Posting Worst case Worst case Multiple Con- Algorithm algorithm algorithm split index term size parents currency

1997

"... In PAGE 35: ...umbers. Therefore, their storage representation will be a small number of bits. 4.8 Summary of Algorithm Properties Table2 summarizes the advantages and disadvantages of the various splitting/posting algorithms we described in the previous sections. We do not include an entry for algorithm A/cp.... ..."

Cited by 13

### Table 1: The descriptor collection and index properties for each descriptor scheme.

2006

"... In PAGE 6: ... Each descriptor collection was produced by rst resizing each image such that its larger edge was 512 pixels and then calculating the local descriptors. Table1 shows the descrip- tor collections created for our experiments. As the table shows, we compared four di erent local descriptor schemes of various dimensionalities including our E 2 descriptors.... In PAGE 7: ...Table 1: The descriptor collection and index properties for each descriptor scheme. ber of descriptors extracted from the image collection, we adopted the segmentation strategy accordingly, as shown in Table1 . The table also shows the size of the indices; creating each setup of three indices took 2 to 6 hours.... ..."

Cited by 3

### Table 1. Classification of decomposition techniques Strategy Properties of Decomposition Indexing Structures

1996

"... In PAGE 6: ...classification yields five strategies as in Table1 . We discuss a brief description with respect to five decomposition strategies and attempt to capture their particular properties concerning evaluation criteria outlined in Section 2.... ..."

Cited by 1