Before revision:  For sliding windows, we obtain a (1+\epsilon)-approximation to F_p using \frac{\log^2 n{\epsilon^2}} bits of space for p\in(0,2], resolving a longstanding question of Braverman and Ostrovsky (FOCS 2007).
After revision:  For sliding windows, we obtain a (1+\epsilon)-approximation to F_p  \frac{\log^2 n{\epsilon^2}} bits of space for p\in(0,2], resolving a longstanding question of Braverman and Ostrovsky (FOCS 2007).