### Table2. The overall complexity value of the schema document WS-BaseFault.xsd amp; C(XSD).

### TABLE II COMPUTATIONAL COST IN REAL MULTIPLICATIONS OF THE ADAPTIVE BM-TEQ ALGORITHM FOR A REAL-VALUED AND A COMPLEX-VALUED TEQ AS WELL AS FOR RLS-BASED AND RLS/LMS-BASED SOS. Na IS THE NUMBER OF ACTIVE TONES AND T IS THE NUMBER OF TEQ TAPS.

### Table 3: Invariants example complexity measurement values When assessing the complexity of OCL expressions for an entire unit, we can simply sum all complexity values for all conditions in the unit. For example, we can compute the guard condition complexity over an entire statechart by adding individual complexity values for each guard condition. Similarly, we can sump up all complexity values for all contracts, sequential constraints, or action postconditions.

2005

Cited by 2

### Table 1: recognition results for 14 defect-related qualitative symbols, expressed in the form of confusion matrix, obtained on a test corpus of 217 defect signals. The codebook size is 256 and 32 Fourier coe cients (complex-valued) are used.

"... In PAGE 10: ... In other words, all signals to be recognized are not seen by the system before the test. In Table1 , we give the conversion result by G 1 for one of the two generators, no signi cant di erence in recognition rate is observed for the other generator. For some defects, training data are insu cient.... ..."

### Table 6: Multidimensional complex-valued FFT MFLOPS

1988

"... In PAGE 34: ... The performance figures for the CM-2 depend on the size of the FFT rather than the dimensions of the transform. The results in Table6 demonstrate that the CM-2 is most effective on large FFTs, that is, when all of the available processors are utilized. ... ..."

### Table 2. Performance for Encoding the Complex-Valued Function

### Table 1 gives an indication of the range of I (obtained experimentally from the simulation performed on our test data). In our following results, we have imposed the constraint I 10 and the complexity values are given for I = 10. Note that the complexity values given correspond to the peak values and the average complexity would be somewhat lower. Entropy Coding Hu man Coding

2002

"... In PAGE 13: ... Table1 : Number of iterations (1D case) Table (2) shows the numerical results of the proposed quantizers at di erent bit rates. The rst column is based on a constraint on the total self information (SI).... ..."