2520 search results - page 45 / 504 » The complexity of approximating entropy |
NIPS
1996
14 years 11 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
ICIP
2000
IEEE
15 years 2 months ago
2000
IEEE
We have developed a scalable image compression scheme with a good performance-complexity trade-off. Like JPEG, it is based on the 8 × 8 block discrete cosine transform (DCT), but...
TCS
2008
14 years 10 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...