A few simple tests that uncovered problems.
Added windowed DTW; searches a given subspace of the M*N possible paths.

This should be useful for implementing FastDTW (Salvador & Chan 2007) and other faster approximations to DTW.