### Table 2. Performance of distance based enhancement using a distance transfer function.

2004

"... In PAGE 13: ...The performance test for distance transfer function using four data sets is shown in Table2 . Compared with the register combiners based approach, the main drawback for the LUT based distance transfer function implementation is that the distances are calculated in software which needs to be done every time when the focal region position or the radius of the focal region is changed.... ..."

Cited by 2

### Table 7: Dependence Distance Based Search. Program Statements Dep. Distance

"... In PAGE 7: ... We found that this ordering is quite effective because even though the chops may contain many statements, if the above ordering is followed, the user encounters the faulty statement after examining only a few statements. The result of a study to demonstrate this point for s-flex versions are presented in Table7 . In the six versions we succeeded in finding critical predicates, to locate the faulty statement we only needed Table 7: Dependence Distance Based Search.... ..."

### Table 7: Dependence Distance Based Search. Program Statements Dep. Distance

"... In PAGE 7: ... We found that this ordering is quite effective because even though the chops may contain many statements, if the above ordering is followed, the user encounters the faulty statement after examining only a few statements. The result of a study to demonstrate this point for s-flex versions are presented in Table7 . In the six versions we succeeded in finding critical predicates, to locate the faulty statement we only needed Table 7: Dependence Distance Based Search.... ..."

### Table 3: Edit Distance based on Transducers with Standard Automata

"... In PAGE 10: ... Actually, the approach calculates the minimal distance of a word accepted by the first automaton with a word accepted by the second automaton. Applying this approach to the sample data set results in the edit distance values contained in Table3 The table contains only the upper triangular matrix to improve the readability. The matrix has been proven to be symmetric.... In PAGE 10: ... The remaining automata each have a word which has an edit distance of one. As a consequence, of this uniform results contained in Table3 it turns out that this approach can not be considered to be useful although it can handle cyclic automata. Therefore the analysis of the criteria is omitted.... ..."

### Table 4: Edit Distance based on Transducers with Weighted Automata

"... In PAGE 11: ...1. Applying the approach on the acyclic automata of the sample data set results in the distance values contained in Table4 . The table contains only the upper triangular matrix to improve the readability.... In PAGE 14: ...approach based on weighted automata turns out to provide a distance measure which pro- vides only a coarse grained differentiation of automata (see Table4 ). However, the n-gram based approach (see Table 5) has two major draw backs: it requires high computational effort in case of automata with complex cycles, that is, at least two cycles in an automaton share at least a single state.... ..."

### Table 2. The prediction error (%) on fractal data when classifying new samples using distance-based statistical techniques and clustering based maximum likelihood methods.

2002

"... In PAGE 10: ... For each sample from the test set, we computed Mahalanobis distances from the Yes and the No distributions and the obtained accuracy through 100 repeated experiments is reported at Table 2. The standard statistical methods based on Kullback-Leibler (KL) distance had similar performance, although the prediction error was slightly larger (left half of Table2 ). Maximum likelihood clustering based parametric methods on fractal data could not over-perform the methods based on standard statistical tests.... ..."

Cited by 5

### TABLE II COST FOR DISTANCE-BASED CLUSTERING

### TABLE I AN EXAMPLE OF THE DISTANCE-BASED SCHEME.

### Table 3. False Rejection rate on the test with di erent values of false acceptance rates in the Euclidian distance based system

2004

"... In PAGE 5: ...f experiment is shown Figure 1(b). The threshold of RBF kernel is -0.08437 and at this point we observed the 11 False reject and 682 False accept. Experiment result of Euclidian distance based identi cation is shown in Table 3, Figure 2(a) and result of veri cation is shown in Table3 , Figure 2(b). Results of SVM and Euclidian distance based system are shown the improved evaluation performance when it use proposed method.... ..."

Cited by 1

### Table 2. The accuracy achieved by randomly choosing cases for feature construction, using the Manhattan and Euclidian distances of base feature weights.

2005

"... In PAGE 7: ... The accuracy was estimated by 10-fold cross validation using a test set of 100 classi- fication tasks. Table2 shows the results for different 2http://www.garageband.... ..."

Cited by 3