Sat, 29 Sep 2001 10:24:52 +0800 (GMT-8), Saswat Anand <[EMAIL PROTECTED]> pisze:
> As regard to Marcin's suggestion of using a list of compact arrays,
> although elements can be accessed faster, there will be a lot if
> redundancy since windows are overlapping. So consecutive arrays
> will contai
Saswat Anand <[EMAIL PROTECTED]> writes:
> As regard to Marcin's suggestion of using a list of compact arrays,
> although elements can be accessed faster, there will be a lot if
> redundancy since windows are overlapping. So consecutive arrays
> will contain almost same data.
Hmmm - a circular
>The downside is that accessing elements within the window will take time
>O(window size). Are the windows large enough that this is a concern?
Yes windows are quite large and elements need to be accessed very
frequently.
As regard to Marcin's suggestion of using a list of compact arrays,
altho
Fri, 28 Sep 2001 20:28:29 +0900, Dylan Thurston <[EMAIL PROTECTED]> pisze:
> This sounds perfectly suited to Haskell's standard lazy lists. If you
> only keep a pointer to the beginning of the data you need to work on,
> then Haskell will automatically read in exactly as much data as you
> use a
On Fri, Sep 28, 2001 at 05:31:20PM +0800, Saswat Anand wrote:
> I have a very large time-series data. I need to perform some operation on
> that. At any instant of time, I only need a window-full of data, size of
> window being known. Starting from the first point, I slide the window
> towards rig
right and operate on the data that reside in the current window.
Currently, I read all of the data to arrays which takes a lot of space and
hence GC takes up lot of time.
After reading "Streching Storage Manager: Weak pointers, Stable
names" paper, I had a feeling that I can do something
