Sciweavers

334 search results - page 42 / 67
» Boosting with structural sparsity
Sort
View
INTERSPEECH
2010
13 years 2 months ago
Context adaptive training with factorized decision trees for HMM-based speech synthesis
To achieve natural high quality synthesised speech in HMMbased speech synthesis, the effective modelling of complex acoustic and linguistic contexts is critical. Traditional appro...
Kai Yu, Heiga Zen, François Mairesse, Steve...
JMLR
2010
161views more  JMLR 2010»
13 years 2 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
Lin Xiao
ICASSP
2011
IEEE
12 years 11 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
JMLR
2012
11 years 10 months ago
On Sparse, Spectral and Other Parameterizations of Binary Probabilistic Models
This paper studies issues relating to the parameterization of probability distributions over binary data sets. Several such parameterizations of models for binary data are known, ...
David Buchman, Mark W. Schmidt, Shakir Mohamed, Da...
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 10 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...