Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
142,894
Table 1: Segmentation results using images from Berkeley dataset [5]. ITV OUR
"... In PAGE 9: ... Table1 shows specific results for each of the images shown in Fig. 7.... ..."
Table 2: Admissions to Berkeley graduate programs
"... In PAGE 2: ...ents at U. C. Berkeley in 1973. Aggregate data for the six largest departments are shown in Table2 , classified by admission and gen- der. The issue was whether these data showed evidence of gender bias in admissions.... In PAGE 3: ...Fourfold displays Table2 is an example of a 2 #02 2 table. For such data, the odds ratio, #12 = n 11 n 22 =n 12 n 21 , is a natural measure of the strength of association between the two variables.... In PAGE 4: ...1 Survival on the Titanic Given the interest in the sinking of the Titanic, it is somewhat sur- prising that neither the exact death toll from this disaster nor the dis- tributions of death among the passengers and crew are universally agreed. Dawson (1995, Table2 ) presents the cross-classification of 2201 passengers and crew on the Titanic by Age, Gender, Class (1st, 2nd, 3rd, Crew) shown in Table 3 and describes his efforts to reconcile various historical sources. Let us see what we can learn from this dataset.... ..."
TABLE I. THE SEQUENCE-STRUCTURE PAIRS*. s p % DIFF.
1996
Cited by 27
Table 1. ROBDD vs. MLDD in size and performance with Berkeley ordering
1996
"... In PAGE 8: ... CPU-time was taken on a HP Vectra 5/133 with 48Mbytes of RAM. From Table1 , MLDDs turn out to be more compact on average of 18%. Some benchmarks give particularly good results, for example comp and pair, benchmarks which TDNOR is very effective in decomposing output functions until reaching input variables or very simple functions.... ..."
Cited by 2
Table 1. Information about the simulated segments of the benchmark programs skipped simulated %
"... In PAGE 4: ... We employed SimPoint [23] to select a representative subset (500 million instructions in length) of each benchmark trace. Table1 shows the number of instructions (in billions) that are skipped before beginning the cycle-accurate simulations, the number of simulated load instructions (in millions), the percentage of simulated instructions that are loads and the IPC on the baseline CPU, for each program. Table 1.... ..."
Table 1. Information about the simulated segments of the benchmark programs
2005
"... In PAGE 5: ... 4.3 Benchmarks Table1 describes the ten C programs (six integer and four float- ing-point) from the SPECcpu2000 benchmark suite [23] that we use for our measurements. They were compiled on a DEC Alpha 21264A processor using the DEC C compiler under the OSF/1 v5.... In PAGE 5: ... We utilize SimPoint [24] to select a representative subset (500 million instructions in length) of each benchmark trace. Table1 shows the number of instructions (in billions) that are skipped before beginning the cycle-accurate simulations, the number of simulated load instructions (in millions), the percent- age of simulated instructions that are loads and the IPC on the baseline CPU. The following SPECcpu2000 programs are not used.... ..."
Cited by 2
Table 2: Latency of storage operations in milliseconds. Queries retrieve all stored tuples. BDB shows perfor- mance of the Berkeley DB without serialization, and Se- rial BDB shows performance of the Berkeley DB with se- rialization.
2001
"... In PAGE 8: ... All tests use a store with 1,000 such tuples. Table2 shows the results for the comparison between structured I/O and the Berkeley DB. Writes are dominated by the cost of forcing each write to disk and thus perform the same in all cases.... ..."
Cited by 36
Table 3. Sharing a Berkeley DB database (2).
"... In PAGE 9: ... This configuration reduces the total number of page faults in the system. Table3 shows the results. Configuration Running time (sec) Local 6.... ..."
Results 1 - 10
of
142,894
