Statistical-ComputationalTrade-offsforDensity Estimation

Neural Information Processing Systems 

Inparticular,ifanalgorithm uses O(n/logck) samples for some constantc > 0 and polynomial space, then the query time of the data structure must be at leastk1 O(1)/loglogk, i.e., close to

Similar Docs  Excel Report  more

TitleSimilaritySource
None found