### Table 4. Quality of the FLOC algorithm with re- spect to action orders

2002

"... In PAGE 9: ... With this technique, the problem mentioned above can be avoided since the positive actions at the end of one iteration may be at a very early posi- tion of the next iteration. Table4 in the experimental results section shows the benefit of this improvement. On average, the quality of the final clustering (i.... In PAGE 9: ... In the case that gi = gj, p(i; j) = 0:5. Table4 shows the improve- ment of the weighted random order algorithm. The weighted approach produces about 5% improvement in the quality of Table 1.... In PAGE 11: ... Order of Actions One of the improvements that we made to the FLOC al- gorithm is the action reordering at the beginning of each iter- ation. Table4 shows the effects of action reordering. There are three ordering methods: fixed, random, and weighted.... ..."

Cited by 1

### Table 4. Quality of the FLOC algorithm with re- spect to action orders

"... In PAGE 9: ... With this technique, the problem mentioned above can be avoided since the positive actions at the end of one iteration may be at a very early posi- tion of the next iteration. Table4 in the experimental results section shows the benefit of this improvement. On average, the quality of the final clustering (i.... In PAGE 9: ... In the case that g i = g j , p#28i; j#29 = 0:5. Table4 shows the improve- ment of the weighted random order algorithm. The weighted approach produces about 5#25 improvement in the quality of Table 1.... In PAGE 11: ... Order of Actions One of the improvements that we made to the FLOC al- gorithm is the action reordering at the beginning of each iter- ation. Table4 shows the effects of action reordering. There are three ordering methods: fixed, random, and weighted.... ..."

### Table 5. Quality of the FLOC algorithm with re- spect to various embedded cluster volume

2002

"... In PAGE 8: ... In our experiments, we explore the effects of mixed values and find that the FLOC algorithm can well adjust the cluster size and discover both large and small clusters. Table5 in the experimental results section shows the recall and precision of the FLOC algorithm with the mixed initial clustering technique. 5.... In PAGE 12: ... The volume of the embedded clusters follows an Erlang distribution. Table5 shows the quality of the our FLOC algorithm with respect to the variance of the Erlang distribution. In this test, the weighted order technique is em- ployed.... ..."

Cited by 1

### Table 5. Quality of the FLOC algorithm with re- spect to various embedded cluster volume

"... In PAGE 8: ... In our experiments, we explore the effects of mixed #1A values and find that the FLOC algorithm can well adjust the cluster size and discover both large and small clusters. Table5 in the experimental results section shows the recall and precision of the FLOC algorithm with the mixed initial clustering technique. 5.... In PAGE 12: ... The volume of the embedded clusters follows an Erlang distribution. Table5 shows the quality of the our FLOC algorithm with respect to the variance of the Erlang distribution. In this test, the weighted order technique is em- ployed.... ..."

### Table 1. Performance comparison of FLOC and CC algorithms avg. residue avg. volume avg. gene num. avg. cond. num. time

2003

"... In PAGE 6: ... We compare our FLOC algorithm with the Cheng-Church algorithm (CC algorithm) proposed by Cheng and Church (2000) on the yeast micro array containing 2884 genes un- der 17 conditions. Table1 shows the performance of the two algorithms. Both algorithms are used to find 100 largest bi- clusters whose residue is less than 300.... ..."

Cited by 23

### Table 1. Mean dissociation time f of small flocs as simulated for various levels of hydrodynamic approximation [up to terms of order (a/ r) quot;]

"... In PAGE 4: ...865 mPa s (water at 300 K). Table1 lists values of the mean dissociation time t obtained by truncating the series expansion at various values of (air) quot;. (Terms of order F2 and F5 are identically zero even for liquid particles of finite viscosity.... ..."

### Table 1. Comparison of results between grids with and without diagonals. New results

1994

"... In PAGE 2: ... For two-dimensional n n meshes without diagonals 1-1 problems have been studied for more than twenty years. The so far fastest solutions for 1-1 problems and for h-h problems with small h 9 are summarized in Table1 . In that table we also present our new results on grids with diagonals and compare them with those for grids without diagonals.... ..."

Cited by 11

### Table 1{Performance bounds for zero propagation delay algorithms Class of Scheduling Range of Property P3 Property P2 Property P1 Algorithms Throughput k N k

1997

"... In PAGE 13: ...3 For gt; 12, S 6, and n 3, no scheduling algorithm in the class CONTIN- UOUS STATIC has any property P1{P4. Table1 summarizes the throughput and delay characteristics of the scheduling algorithms pre- sented in this and the previous section. The last three columns list the upper bounds for k N k,... ..."

Cited by 45

### Table 2. Speedup in Worst-Case Execution Time for Optimized Virtual Table Algorithm

"... In PAGE 5: ... However, for the OVTA, the optimiza- tion over VTA depends completely on the characteristics of the generator polynomial chosen. Table2 shows the improvement over the VTA for several different polyno- mials (refer to Section 4 for a description of CRC32sub8 and CRC32sub16) . Note that for the particular CRC24 and CRC32 polynomials we used for our experiments, the OVTA has no improvement at all over the VTA.... ..."