From df6f3dfa6866bc1a6e05461f5fcd15fa7d14db90 Mon Sep 17 00:00:00 2001 From: fc_botelho Date: Sun, 23 Mar 2008 03:54:54 +0000 Subject: [PATCH] *** empty log message *** --- README.t2t | 4 +--- scpscript | 1 + 2 files changed, 2 insertions(+), 3 deletions(-) diff --git a/README.t2t b/README.t2t index f0d58d5..bcde386 100644 --- a/README.t2t +++ b/README.t2t @@ -75,12 +75,10 @@ The CMPH Library encapsulates the newest and more efficient algorithms in an eas 4.1 bits per key to be stored. For that, you just need to set the parameters -a to brz and -c to a value larger than or equal to 2.6. -%html% [Click Here comparison.html] to see a comparison between the algorithms BMZ and CHM. - ---------------------------------------- -==News for version 0.8== +==News for version 0.8 (Coming soon)== - [An algorithm to generate MPHFs that require around 2.6 bits per key to be stored bdz.html], which is referred to as BDZ algorithm. The algorithm is the fastest one available in the literature for sets that can be treated in internal memory. - The hash functions djb2, fnv and sdbm were removed because they do not use random seeds and therefore are not useful for MPHFs algorithms. diff --git a/scpscript b/scpscript index dd30fbb..9c113c1 100755 --- a/scpscript +++ b/scpscript @@ -1,2 +1,3 @@ scp -r *.html fc_botelho@shell.sourceforge.net:/home/groups/c/cm/cmph/htdocs scp -r examples/*.c examples/keys.txt fc_botelho@shell.sourceforge.net:/home/groups/c/cm/cmph/htdocs/examples +scp -r papers/*.pdf fc_botelho@shell.sourceforge.net:/home/groups/c/cm/cmph/htdocs/papers/