2520 search results - page 191 / 504 » The complexity of approximating entropy |
101
click to vote
CPC
1999
14 years 10 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
TIT
1998
14 years 10 months ago
1998
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Most algorithms for 3D reconstruction from images use cost functions based on SSD, which assume that the surfaces being reconstructed are visible to all cameras. This makes it dif...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
ICIP
2008
IEEE
16 years 24 days ago
2008
IEEE
An approach to scalable multi-view video coding with joint best basis wavelet packets is examined in this paper. A 4-D wavelet transform is used to decorrelate the multi-view vide...