### Table 5.1: Alice and Bob generate a polynomial for each of their private valuations. They each evaluate their polynomials at two points. These two points are the shares generated for each secret.

2007

Cited by 1

### Table 6.2: Input-output complexity of computing interconnection queries. D is always assumed to conform to S. If S is a tree, the complexity is always polynomial in D and the output.

2004

Cited by 2

### Table 6. Evaluation of the integrated technology for preciseness and verifiability

in A

2003

"... In PAGE 35: ....5.2 1990s- present Active research on integration of UML and formal methods or on adding formal semantics to UML are being accomplished. External Exploration Popularization Table6 represents the technology maturity evaluation result of the integrated technology for preciseness and verifiability. It shows that it is in the internal exploration level.... ..."

### TABLE I Computation time in microseconds for evaluating the polynomials

2002

Cited by 2

### Table 4. Post-implementation evaluation of the private sector.

"... In PAGE 8: ... Table 3 shows the mean and standard deviation of post-implementation evaluation in the public sector. Table4 shows the mean and standard deviation of post-implementation evaluation in the private sector. Rank Factor Mean Std Deviation Scale 1.... ..."

### Table 2: Results for Verifying Pipelined Cosine Circuits

in N −1

"... In PAGE 4: ... The verified implementations are: 64-bit, 8-bit rounded and truncated (Section 2.1, case 1), and approximated by 8 bits (case 2), respectively, as shown in Table2 . Obtained AT is compact, as shown by the 3rd column with sizes of all intermediate (and final) AT, MAT and MATS polynomials.... ..."

### Table 2: Optimal latency of polynomial evaluation on the Itanium processor

"... In PAGE 4: ... We have, by exhaustive enumeration, determined the optimal evaluation method (in terms of latency) of general and some special polynomials up to moderate degrees. Table2 tabulates the results, for example, of general polynomials up to degree 15 on the Ita- nium processor. That we can evaluate long polynomials very quickly leads to interesting algorithms.... ..."

### Table 3: Number of needed operations for cubic convolution polynomial evaluation

"... In PAGE 3: ... Table 1 and 2 show the coefficient of the transformed polynomials for cubic and quin- tic order interpolation. 4 PERFORMANCE ANALYSIS Table3 shows the number of operations for the polynomial evaluation for the classical 1-D cubic convolution. Table 4 shows the results for ar- bitrary n-th order interpolation.... ..."

### TABLE I EVALUATION OF THE SWITCHED CAPACITANCE POLYNOMIAL FOR DIFFERENT INPUT PROBABILITIES.

1999

Cited by 3