Performance issue sparse-dense maxpooling backward

The current implementation of sparse-dense maxpooling_backward uses for every p-q combination a full scan over the sparse row just to find the applicable range. We should instead flip this dense implementation to a "real" sparse implementation that scans the sparse input just once.