Sciweavers

1285 search results - page 227 / 257
» On the Complexity of Ordinal Clustering
Sort
View
PAMI
2011
13 years 2 months ago
Multiple Kernel Learning for Dimensionality Reduction
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
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...
SIAMREV
2010
170views more  SIAMREV 2010»
13 years 2 months ago
Network Properties Revealed through Matrix Functions
The newly emerging field of Network Science deals with the tasks of modelling, comparing and summarizing large data sets that describe complex interactions. Because pairwise affin...
Ernesto Estrada, Desmond J. Higham
ICASSP
2011
IEEE
12 years 11 months ago
Asymptotically MMSE-optimum pilot design for comb-type OFDM channel estimation in high-mobility scenarios
Under high mobility, the orthogonality between sub-carriers in an OFDM symbol is destroyed resulting in severe intercarrier interference (ICI). We present a novel algorithm to est...
K. M. Zahidul Islam, Tareq Y. Al-Naffouri, Naofal ...
ICASSP
2011
IEEE
12 years 11 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...