2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
Prosenjit Bose, Luc Devroye, Karim Douieb +3
Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measu…