### Table 1. CPU times in seconds for non-interactive (build- ing) and interactive (decision) phases of the Max-Tree al- gorithm for 3-D angiograms.

2002

"... In PAGE 3: ... The speed gain was determined by comparing the time necessary to build the Max-Tree to the decision phase on different vol- ume data sets. The results are shown in Table1 . The re- sults indicate that, given fast rendering hardware, almost 5 frames per second can be reached on the 2563 data set on a Pentium 4 at 1.... ..."

Cited by 3

### Table 1. CPU times in seconds for non-interactive (build- ing) and interactive (decision) phases of the Max-Tree al- gorithm for 3-D angiograms.

2002

"... In PAGE 3: ... The speed gain was determined by comparing the time necessary to build the Max-Tree to the decision phase on different vol- ume data sets. The results are shown in Table1 . The re- sults indicate that, given fast rendering hardware, almost 5 frames per second can be reached on the 2563 data set on a Pentium 4 at 1.... ..."

Cited by 3

### Table 3: Statistics for the number of pairs of non-interacting requests over 30 random and optimal permutations.

2004

"... In PAGE 4: ... We also compute the average number of pairs of non-interacting requests over 30 permutations evaluated as best known values by Genitor. The results of the pairwise sensitivity test are summarized in Table3 . The second column Total Pairs represents the total number of request pairs in the permutation (if there are n requests, the number in this column is n(n 1)=2).... ..."

Cited by 6

### Table 3: Statistics for the number of pairs of non-interacting requests over 30 random and optimal permutations.

2004

"... In PAGE 4: ... We also compute the average number of pairs of non-interacting requests over 30 permutations evaluated as best known values by Genitor. The results of the pairwise sensitivity test are summarized in Table3 . The second column Total Pairs represents the total number of request pairs in the permutation (if there are D2 requests, the number in this column is D2B4D2 A0 BDB5BPBE).... ..."

Cited by 6

### Table 3: Statistics for the number of pairs of non-interacting requests over 30 random and optimal permutations.

2004

"... In PAGE 4: ... We also compute the average number of pairs of non-interacting requests over 30 permutations evaluated as best known values by Genitor. The results of the pairwise sensitivity test are summarized in Table3 . The second column Total Pairs represents the total number of request pairs in the permutation (if there are a1 requests, the number in this column is a1 a32a5 a1 a8 a5 a38a10a6a5a8a7 ).... ..."

Cited by 6

### Table 4.1: Three private set protocols compared in different security settings. ROM stands for Random Oracle Model , NIZK for Non-Interactive Zero Knowledge , and UC for Universally Composable .

2006

### Table 1. Comparison of performance of baseline non-interactive searching (ruibsl) with the secondary task of saving a final query (ruint1/q1) for one set of interactive searches per topic, top 1000 documents.

1996

"... In PAGE 3: ... Comparison of performance of baseline non-interactive searching (ruibsl) with the secondary task of saving a final query (ruint1/q1) for one set of interactive searches per topic, top 1000 documents. The evaluations of the retrieval results for ruint1/q1 and ruibsl, according to the standard TREC evaluation measures, are presented in Table1 . It should be noted here that although average precision over the top 1000 documents is significantly higher for the interactive searches, the difference between precision at 30 documents is rather less, as is that of R-Precision.... In PAGE 3: ... It should be noted here that although average precision over the top 1000 documents is significantly higher for the interactive searches, the difference between precision at 30 documents is rather less, as is that of R-Precision. Table1 compares the results of only one interactive search for each topic with the one baseline search. In addition, three of the interactive searches in this set had no final query, which leads to some prob- lem with interpretation of the comparison.... ..."

Cited by 18

### Table 6: Non-interactive ad hoc trials

1995

"... In PAGE 12: ... 4 In a few cases this resulted in the #0Cnal query containing less than the speci#0Ced number of terms. 5 Note that the average precision, R#7Bprecision and recall #0Cgures in Table6 are arti#0Ccially low because we used the full set of disks... ..."

Cited by 83

### Table 6.4: Workload for non-interactive applications

1999

Cited by 1