### Table 2: STATE COMPLEXITY OF INFORMATION SYSTEMS WITH A MODERATE NUMBER OF ATTRIBUTES Number of attributes

1997

"... In PAGE 8: ...even when there are only a few number of attributes ( Table2 ). We observe that any real life data base contains only few data with respect to the state complexity.... ..."

Cited by 11

### Table 1. The complexity and required information to compute the restoration path for different algorithms

2004

Cited by 1

### TABLE I. THE COMPLEXITY AND REQUIRED INFORMATION TO COMPUTE THE RESTORATION PATH FOR DIFFERENT ALGORITHMS

### Table 1. Metrics of information complexity for automation displays in air traffic control

2004

"... In PAGE 10: ... Given the differences inherent among the three infor- mation-processing stages, the three complexity factors should be evaluated separately at each stage. This results in a 3x3 matrix as shown in Table1 , with rows being the three complexity factors and columns being the three information-processing stages. Each box in the matrix corresponds to one IC metric.... ..."

### Table 2: Complexity of computation of the sub-matrices of the information matrix

2000

Cited by 1

### Table 1. Comparison of Segmentation-based Non-preemptive Scheduling Algorithms Algorithm Time Complexity State Information

2003

Cited by 4

### Table 2. Comparison of Segmentation-basedNon-preemptive Scheduling Algorithms with FDLs Algorithm Time Complexity State Information

2003

Cited by 4

### Table 2: Complexity in terms of amount of information exchanged or operations performed for each phase of the computation.

1999

"... In PAGE 19: ... Remember that a word copy requires two word accesses: a read and a write access. Table2 summarizes the complexity of each one of the algorithm phases. The complexity listed in Table 2 is for a single execution of the phase.... In PAGE 19: ... Table 2 summarizes the complexity of each one of the algorithm phases. The complexity listed in Table2 is for a single execution of the phase. To obtain the portion of time spent in each phase we also need to take into consideration the hardware speed, the number of times that each phase has to be performed, and the overlapping among phases.... In PAGE 20: ...Table 3: Hardware parameters assumed for the design point for the year 2006/2007 6 Hardware Parameters To estimate how long a sub-block multiplication in a SPELL takes, we have to multiply the number of oating point operations given in Table2 by the average period of a SPELL oating point unit and divide by the number of units available in the SPELL: MS = 2 (bc)3 SFt #F P U=SP ELL (10) where MS is the average time required for one sub-block multiplication, and SFt is the average cycle of the SPELL FPU. A SPELL processor has 5 oating-point functional units (FPUs) operating with an average cycle time, SFt, of about 15 ps [8] 4.... In PAGE 22: ... If we assume that MS gt; DS, Dt[A] = Dt[B], IPDS = OPSD, and IPSC = OPCS, we can rewrite equations 16 and 17 as T = 2 Dt[A] + 3 IPDS + t2 TB + Dt[C] (18) TB = t s MS + (2t + 1) IPSC (19) replacing equation 19 in equation 18 we obtain T = 2 Dt[A] + Dt[C] + 3 IPDS + t3 s MS + t2 (2t + 1) IPSC (20) We now want to estimate each one of the components of the execution time. Table2 has the expression for the number of word accesses required for the transformation of matrices A, B and C in DRAM. The data transformation in DRAM is performed in parallel by s2 DPIMs.... ..."

Cited by 3