### Table 11 Main algorithm

"... In PAGE 24: ...4.3 Transfer Algorithm Table11 contains a more formal speci cation of the main algorithm for the transfer task.... ..."

### Table 1. Main Algorithm

"... In PAGE 3: ... 2.2 Algorithm The algorithm is very simple and fast, see Table1 . It has the capacity to operate with continuous and discrete variables as well as with databases which have two classes or multiple classes.... ..."

### Table 1. Main Algorithm

"... In PAGE 4: ... Applying our hypothesis, the first attribute is more relevant than the second one, because it has a smaller NLC. 4 Algorithm The algorithm is very simple and fast ( Table1 ). It has the capacity to operate with continuous and discrete variables as well as with databases which have two classes or multiple classes.... ..."

### Table 1. Main Algorithm

"... In PAGE 4: ... We also obtain NLC(P2)=2. 3 Algorithm The algorithm is very simple and fast ( Table1 ). It has the capacity to operate with continuous and discrete variables as well as with databases which have two classes or multiple classes.... ..."

### Table 4: Main Algorithms Parameters.

"... In PAGE 17: ...two steps: preliminary simulations with typical values found in the literature; ad- ditional simulations in order to optimize these parameters, not in an exhaustive form, however assuring a superior performance than those found in the prelim- inary step. Table4 synthesizes the main parameters used in the simulations. These parameters are grouped in function of loading resulting in two systems, S1 and S2.... ..."

### Table 1: Main algorithm of Cone Cluster Labeling

2006

"... In PAGE 3: ...6) 2.4 Assign Cluster Labels Table1 below shows the CCL algorithm. For the given q value, it first computes Z using Eq.... ..."

Cited by 1

### Table 1: Main algorithm of Cone Cluster Labeling

2006

"... In PAGE 3: ...6) 2.4 Assign Cluster Labels Table1 below shows the CCL algorithm. For the given q value, it first computes Z using Eq.... ..."

Cited by 1

### Table 1: Main algorithm of Cone Cluster Labeling

"... In PAGE 3: ...6) 2.4 Assign Cluster Labels Table1 below shows the CCL algorithm. For the given q value, it first computes Z using Eq.... ..."

### Table 4. Main characteristics of the algorithms

2005

"... In PAGE 10: ....6.7, with a 2.4 gigahertz processor and 4 gigabytes of main memory. Table4 presents the main characteristics of the two algorithms. The num- ber of edges in the graph G =(V,E)is|S| = n, the number of keys in the input set S.... ..."

Cited by 6

### TABLE I MAIN VARIABLES OF THE ALGORITHM

Cited by 2