19 search results - page 1 / 4 » Lower Bounds and Aggregation in Density Estimation |
JMLR
2006
13 years 5 months ago
2006
In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of M density estimators for the Kullback-Leibler d...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
SLS
2009
Springer
13 years 11 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
TDSC
2008
13 years 5 months ago
2008
The fundamental problem for inference control in data cubes is how to efficiently calculate the lower and upper bounds for each cell value given the aggregations of cell values ove...