Hi Mickel,
can you post the reference to that Moffat article? Sounds interesting.
Thanks & regards,
Jochen
> It is also possible to sensibly reduce the above mentioned array
> by compressing ordered lists of occurrence positions. I found a
> paper by Alistair Moffat at the Dept. of Computer Science of Univ.
> of Melbourne describing a method for compressing ordered list of
> numbers.
[...]
> 18 bits on average, which is almost half of the 32 bits you would need
> when storing such a list of numbers in the obvious way.
> If you want, I can send you the program to have a look at it.
-- Jochen Leidner, M.A. <jochen.leidner@sap.com> Developer <http://www.sap.com/> Knowledge Management Infrastructure -- All views expressed are my own. SAP AG, Walldorf, Germany. phone +49 (6227) 7-63773 fax +49 6227 7-73773
This archive was generated by hypermail 2b29 : Fri Mar 31 2000 - 19:59:26 MET DST