Results 1 - 10 of 90,987

Table 1. Automatic generation of sets of MRAs: CPU time (secs)

in A Logical Formalisation of the Fellegi-Holt Method of Data Cleaning
by Agnes Boskovitz, Rajeev Gore, Markus Hegland 2003
"... In PAGE 9: ...he same deduced checks. The CPU time for this small example was 0.7 seconds. Our subsequent tests were on assorted small randomly generated sets of checks, each with two involved fields. Table1 lists the CPU times of some of our results. We used various combinations of three parameters: number of checks, number of fields and maximum size of the fields.... ..."
Cited by 2

Table of Large Sets: v 18

in A Few More Large Sets of t-Designs
by Yeow Meng Chee, Spyros S. Magliveras 1998
Cited by 5

Table 2: Compression evaluation using les in the Canterbury corpus (Large Set)

in Sahinalp Implementation and experimental evaluation of flexible parsing for dynamic dictionary based data compression. Workshop on Algorithmic Engineering
by Yossi Matias, Nasir Rajpoot, Suleyman Cenk S. Ahinalp 1998
Cited by 2

Table 1: Compression evaluation using files in the Canterbury corpus (Large Set)

in The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression
by Yossi Matias, Nasir Rajpoot, Suleyman Cenk Sahinalp

Table 1: Compression evaluation using files in the Canterbury corpus (Large Set)

in The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression
by Yossi Matias, Nasir Rajpoot, Suleyman Cenk Sahinalp, Suleyman Cenk S

Table 1: Compression evaluation using files in the Canterbury corpus (Large Set)

in The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression
by Yossi Matias, et al.

Table 5: Evaluation on a Large Data Set

in Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach
by Hwee Tou Ng, Hian Beng Lee 1996
Cited by 197

Table 1: Large sparse sets of equations

in unknown title
by unknown authors 1991
"... In PAGE 17: ...coe cients. The largest of the systems in Table1 had b . 107, so this did not cause any problems on the machine that was used.... In PAGE 22: ... Substantial performance improvements can be made fairly easily, even without using assembly language. Table1 describes the linear systems that were used in testing the algorithms. Data sets A through J were kindly provided by A.... ..."
Cited by 46

Table 1: Large sparse sets of equations

in Solving Large Sparse Linear Systems Over Finite Fields
by B. A. Lamacchia, A. M. Odlyzko 1991
"... In PAGE 5: ... Substantial performance improvements can be made fairly easily, even without using assembly language. Table1 describes the linear systems that were used in testing the algorithms. Data sets A through J were kindly provided by A.... In PAGE 10: ...coe cients. The largest of the systems in Table1 had b . 107, so this did not cause any problems on the machine that was used.... ..."
Cited by 46

Table 1: Large sparse sets of equations

in Solving Large Sparse Linear Systems Over Finite Fields
by Lamacchia Odlyzko, B. A. Lamacchia, A. M. Odlyzko 1991
"... In PAGE 5: ... Substantial performance improvements can be made fairly easily, even without using assembly language. Table1 describes the linear systems that were used in testing the algorithms. Data sets A through J were kindly provided by A.... In PAGE 10: ...coe cients. The largest of the systems in Table1 had b . 107, so this did not cause any problems on the machine that was used.... ..."
Cited by 46
Results 1 - 10 of 90,987