Results 11 - 20 of 341

Table 1: Dependencies between subgraphs and attributes

in Vertical Fragmentation and Allocation in Distributed Deductive Database Systems
by Seung-jin Lim, Yiu-kai Ng 1997
"... In PAGE 22: ... The value 1 in each matrix indicates that the corresponding attribute is referenced by a distinct subgraph. It is not di cult to see that the third column of the ith row of Table1 includes all the attributes whose corresponding entries are set to 1 in the ith row of F1, F2, F3, and F4, respectively which is step 1 of DVF. Let us consider F3.... ..."
Cited by 4

Table 1: A Sequence of Subgraph Snapshots

in The RBSE Spider -- Balancing Effective Search Against Web Load
by David Eichmann
"... In PAGE 4: ... Web traffic has grown to place sixth in the ranking of packet traffic on the Internet. Table1 contains some statistics concerning construction of the spider apos;s most recent graph (constructed in late February). The full-text index for this graph is 100 megabytes.... ..."

Table 1: A Sequence of Subgraph Snapshots

in The RBSE Spider - Balancing Effective Search Against Web Load
by David Eichmann
"... In PAGE 4: ... Web traffic has grown to place sixth in the ranking of packet traffic on the Internet. Table1 contains some statistics concerning construction of the spider apos;s most recent graph (constructed in late February). The full-text index for this graph is 100 megabytes.... ..."

Table 1: A Sequence of Subgraph Snapshots

in The RBSE Spider - Balancing Effective Search Against Web Load
by David Eichmann
"... In PAGE 4: ... Web traffic has grown to place sixth in the ranking of packet traffic on the Internet. Table1 contains some statistics concerning construction of the spider apos;s most recent graph (con- structed in late February). The full-text index for this graph is 100 megabytes.... ..."

Table 1: A Sequence of Subgraph Snapshots

in The RBSE Spider - Balancing Effective Search Against Web Load
by David Eichmann
"... In PAGE 3: ... Web traffic has grown to place sixth in the ranking of packet traffic on the Internet. Table1 contains some statistics concerning construction of the spider apos;s most recent graph (constructed in late February). The full-text index for this graph is 100 megabytes.... ..."

Table 2. Experimental Results on the Subgraph Isomorphism Problem

in Pruning by the Use of Equally Constrained Variables
by Igor Razgon, Amnon Meisels
"... In PAGE 13: ... We randomly generated instances of the problem using parameters d1 and d2 that are densities of G1 and G2, respectively. The results are collected in Table2 . The meaning of columns is the same except the parameters of the problem.... ..."

Table 1. P-values of the subgraphs in Fig. 2; subgraph g3 has the smallest p-value.

in GraphRank: Statistical Modeling and Mining of Significant Subgraphs in the Feature Space
by unknown authors
"... In PAGE 4: ... 2. Table1 shows the p-values of the subgraphs as well as their expected supports. Among the subgraphs, g3 has the smallest p-value.... ..."

Table 4. Subgraph sizes and frequencies where subgraph size is described by the number of nodes that form part of a contiguous cluster

in
by unknown authors
"... In PAGE 4: ... The occurrence of a metabolite pre- and post-hub removal (Table 3) may be used to gauge the ubiquity or generality of the role of the metabolite in biochemical reactions. Graph construction Enzyme-centric subgraphs were created from the dataset at each stage of the hub-removal process and the distribution of sizes of the 480 subgraphs that make up the final dataset may be seen in Table4 . The percentage size of this main subgraph is indicative of how well the dataset is connected metabolically.... ..."

Table 1: Number of subgraphs in the graph formed from the Ito data set as the size of the subgraph, k, increases.

in Abstract Finding Motifs in Protein-Protein Interaction Networks
by unknown authors

Table 2. Inverse densities between subgraphs of the graph in Fig. 1.

in Energy Models for Drawing Clustered Small-World Graphs
by Andreas Noack 2003
"... In PAGE 7: ... 1. Table2 gives the inverse densities between subgraphs. There exists no drawing where the arithmetic mean of the distances between nodes equals the inverse densities for all five pairs of subgraphs.... ..."
Cited by 5
Results 11 - 20 of 341