Hi Matt

Thats a great question - I was thinking about that issue this morning. Does
anyone know of a good algorithmic reference (in code or print) for
"windowed" or update-style algos, where an operation is performed on a
rolling window of data, that may be either (a) too large to fit into memory,
so it must be 'chunked', or (b) a stream of continuous data updates?

Cheers
Rory

	[[alternative HTML version deleted]]

