### TABLE IV OPTIMAL PILOT TONE VECTORS IN THE PRESENCE OF FREQUENCY OFFSET FOR A MIMO OFDM SYSTEM WITH K = NTxL,(K =8,NTx =4,L=2)

2005

Cited by 1

### TABLE I OPTIMAL PILOT TONE VECTORS IN THE ABSENCE OF FREQUENCY OFFSET FOR A MIMO OFDM SYSTEM WITH K gt;NTxL,(K =8,NTx =2,L=2)

2005

Cited by 1

### Table 1: Physical layer parameters of the MIMO-OFDM sys- tems used for the performance evaluation.

2006

Cited by 1

### TABLE 1 Comparison between the dense matrix matrix-vector multiplication and the SVD-based matrix-vector multiplication for two different ow elds and geometries. Setup time includes the construction of the matrix and the preconditioner. Solve time is the time used by GMRES solver. We see that as the problem scales, the dense approach grows up quadratically, while SVD based approaches scales almost linearly. domain,

2002

### TABLE 1 Comparison between the dense matrix matrix-vector multiplication and the SVD-based matrix-vector multiplication for two different flow fields and geometries. Setup time includes the construction of the matrix and the preconditioner. Solve time is the time used by GMRES solver. We see that as the problem scales, the dense approach grows up quadratically, while SVD based approaches scales almost linearly. domain,

2002

### Table 6: Time performance for the broadband

"... In PAGE 10: ...2 and BEAM. Timings are shown in Table6 . The results show a speedup of about a factor four when changing to using the bit syntax and compiling with HiPE v 1.... ..."

### Table 6: Time performance for the broadband

"... In PAGE 10: ...2 and BEAM. Timings are shown in Table6 . The results show a speedup of about a factor four when changing to using the bit syntax and compiling with HiPE v 1.... ..."

### Table 1: Features of the polynomial systems

"... In PAGE 8: ... For the time being our implementation handles square sys- tems that generate radical ideals. We compare our al- gorithm called TriangularizeModular with gsolve and Triangularize; For each benchmark system, Table1 lists the numbers n; d; h a46 and Table 2 lists the prime p1, the a priori and ac- tual number of lifting steps (a0 and a) and the maximal height of the output coe cients (Ca). Table 3 gives the time of one call to Triangularize modulo p1 ( p), the equiprojectable decomposition (Ep), and the lifting (Lift.... ..."

### Table 1. Comparison of Computational Times for Solving the Hemisphere Model (Figure 5a) Using Finite Elements (FEM), GPAFF, and LPAFFa

"... In PAGE 9: ... The major advantage of LPAFF is that it is not limited to the computation of linear elastic tissue and real time performance may be obtained without using any pre-computations (Lim amp; De, 2005). Table1 presents a comparison of solution times for the hemisphere problem (Figure 5a). The total time is assumed to be composed of the time to generate the stiffness matrix and time to solve the system of equa- tions.... ..."

### Table 1: Features of the polynomial systems

2006

"... In PAGE 7: ... In addition, for each system, the lifting step con- sumes much less resources (time and space) than the modular triangular decomposition, as reported in [12]. For each of these systems, Table1 gives: (1) the number n of variables; (2) the maximum total degree d of a monomial; (3) the prime number p used for the computation of its mod- ular triangular decomposition. In [12], formu- las for choosing p are given from n, d and other quantities which can be read easily from the in- put system.... In PAGE 7: ... In [12], formu- las for choosing p are given from n, d and other quantities which can be read easily from the in- put system. For each of these systems, Table1 gives two lists where the i-th item corresponds to the i-th component Ti in the triangular decomposition of the system modulo p. The number of solu- tions of Ti is found in the first list whereas the output size of Ti is found in the second.... ..."

Cited by 1