2312 search results - page 68 / 463 » The complexity of estimating min-entropy |
INFOCOM
2012
IEEE
12 years 12 days ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
ICS
2010
Tsinghua U.
14 years 7 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
ICIP
2007
IEEE
14 years 4 months ago
2007
IEEE
A complexity model for motion compensation in the H.264/AVC decoder is proposed. This model considers a rich set of inter prediction modes allowed by H.264 as well as the relation...
CCIA
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
NIPS
2008
13 years 11 months ago
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...