### Table 1 Graph-Based Process Configuration Measures

2002

"... In PAGE 17: ...A sample of graph-based process configuration measures and values is presented in Table1 . The measurements listed under the Process A label are obtained from the example representation presented in Figure 4 above.... In PAGE 22: ... This latter inference represents the kind obtainable only through a ratio scale. A BCD A BC Process A Process C Figure 7 Processes as Standard Sequences To generalize, we can apply the extensive-measurement procedure to the other graph-based measures defined in Table1 as well. For instance, returning to the two directed graphs presented in Figure 7, say we measure a graph-based representation for Process A and obtain a measured value of four for process size.... In PAGE 23: ... As above, we note this is exactly the kind of analysis used to determine the measure mass, used extensively in the physical sciences, which supports a ratio scale. And again, this extensive-measurement approach can be applied to any of the graph-based measures defined in Table1 , in addition to other measures based on like graph-theoretic concepts (e.g.... ..."

### Table 1. Graph-based modeling approaches.

2007

"... In PAGE 4: ... A transition links any two nodes (task or coordinator) and is represented by a directed arc. Table1 provides a list of representative graph-based modeling approaches. Table 1.... ..."

Cited by 1

### Table 1. Experimental [13-15] and Model Permeabilities for Pervious Concretes

2007

"... In PAGE 6: ...ext, solving for v2. Grey voxels illustrate solids and white voxels are porosity....... 5 List of Tables Table1... ..."

### Table 9 Example Process Measures Measure Graph-Based Definition

"... In PAGE 43: ... to support comparative process analysis). A set of example process measures is presented in Table9 , along with their corresponding graph- based definitions. Table 9 Example Process Measures Measure Graph-Based Definition... ..."

### Table 1. Comparison over GraphBase directed graphs.

2005

"... In PAGE 4: ... The first set comes from [8]. The graphs are characterized by their probability (eta = 0:01 is noted r001 in Table1 ) that an edge is present between two distinct node n and n0. Those graphs were used to evaluate vflib algorithm performance [7].... In PAGE 4: ... Experiments show that CSP approach for subgraph matching solves more problem within a time limit against C++ specialized checking-based methods [7]. Table1 and 2 show the percentage of instances solved within a time limit of 5 minutes, for directed and undirected instances. Single specialized propagator MCPA for forbidden edges is more efficient than the version with two propagators.... ..."

Cited by 5

### Table 1: Computational Effort for Landmark Graph-Based Registration

2003

"... In PAGE 6: ... 3 Summary of Computational Effort Each of the processing steps requires worst-case effort that has a polynomial bound. The effort described in Table1 assumes: NxM range images and F landmarks. D is the mean degree of landmark graphs and Q is the total number of edges.... In PAGE 9: ... This involves a post-processing step, where the graph V0 is grown in size after each new image is aligned. This is an O(F) operation, see Table1 . Growing V0 in an on-line fashion would permit extended regions of surface data to be incorporated into a single contiguous data set.... ..."

Cited by 2

### Table 2. Performance of graph-based propagation approach.

2007

Cited by 1