Before revision:  In light of the lower bound we}{\pi}}\right) provide algorithms for estimating \alpha for arbitrary-length intervals under a bounded intersection assumption .
After revision:  In light of the lower bound we}{\pi}}\right)-approximation to \alpha and \beta in poly(\log(n), \epsilon^{-1 provide algorithms for estimating \alpha for arbitrary-length intervals under a bounded intersection assumption .