Sciweavers

2312 search results - page 51 / 463
» The complexity of estimating min-entropy
Sort
View
ICIP
2008
IEEE
14 years 11 months ago
Complexity modeling of spatial and temporal compensations in H.264/AVC decoding
Abstract-- Complexity modeling of spatial-temporal compensations in H.264/AVC decoding is performed by examining a rich set of inter- and intra-prediction modes. Specifically, we s...
Szu-Wei Lee, C. C. Jay Kuo
COLT
2001
Springer
14 years 2 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
IJCGA
2007
44views more  IJCGA 2007»
13 years 9 months ago
On the Expected Size of the 2D Visibility Complex
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which corres...
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, ...
ICCS
2007
Springer
14 years 4 months ago
Complexity of Monte Carlo Algorithms for a Class of Integral Equations
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
Ivan Dimov, Rayna Georgieva
NIPS
1996
13 years 11 months ago
Radial Basis Function Networks and Complexity Regularization in Function Learning
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...
Adam Krzyzak, Tamás Linder