Sciweavers

2520 search results - page 270 / 504
» The complexity of approximating entropy
Sort
View
TVCG
2010
162views more  TVCG 2010»
15 years 5 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
ACL
2009
15 years 4 months ago
A Note on the Implementation of Hierarchical Dirichlet Processes
The implementation of collapsed Gibbs samplers for non-parametric Bayesian models is non-trivial, requiring considerable book-keeping. Goldwater et al. (2006a) presented an approx...
Phil Blunsom, Trevor Cohn, Sharon Goldwater, Mark ...
ICASSP
2011
IEEE
14 years 10 months ago
Bayesian reinforcement learning for POMDP-based dialogue systems
Spoken dialogue systems are gaining popularity with improvements in speech recognition technologies. Dialogue systems can be modeled effectively using POMDPs, achieving improvemen...
ShaoWei Png, Joelle Pineau
ICML
2009
IEEE
16 years 7 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
16 years 1 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...