2520 search results - page 332 / 504 » The complexity of approximating entropy |
161
Voted
ECCC
2010
14 years 11 months ago
2010
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
164
click to vote
INFORMATICALT
2010
14 years 11 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
122
click to vote
INTERSPEECH
2010
14 years 11 months ago
2010
In this paper, we propose to improve our previously developed method for joint compensation of additive and convolutive distortions (JAC) applied to model adaptation. The improvem...
134
click to vote
JMLR
2010
14 years 11 months ago
2010
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...
122
click to vote
TOG
2010
14 years 11 months ago
2010
We present a general framework for analyzing the transport matrix of a real-world scene at full resolution, without capturing many photos. The key idea is to use projectors and ca...