Merge branch 'max-experimental'

This seems functional enough.
OpenCL: Exponents > 2

Now, exponents greater than two may be used for building the result
tree. With an exponent of four (always grouping 16 values), the
implementation is now (for me, at least) about as fast as the CPU
implementation for the original sequence and even faster when exceeding
about 100 MB.

To achieve this, the host pointer policy has to be changed to
CL_MEM_USE_HOST_PTR (leave buffer in host memory).

Measurements are taken for the index being half of the sequence length
(which is around two thirds into the sequence).

There is perhaps still room for improvement regarding the generated
result buffer (it is still too big).
CPU implementation: Fix target index

Change the target index to be half of the sequence length and set the
lower index to 0 to match the OpenCL implementation (using sequence
length - 10 is plain wrong anyway).
SSE implementation

+ Just for fun, I added an SSE implementation for reference. On first
  tests, it is about eight times faster than the given CPU
  implementation (which just adds to our despair).