Sciweavers

4342 search results - page 516 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Clustering of bootstrapped acoustic model with full covariance
HMM-based acoustic models built from bootstrap are generally very large, especially when full covariance matrices are used for Gaussians. Therefore, clustering is needed to compac...
Xin Chen, Xiaodong Cui, Jian Xue, Peder Olsen, Joh...
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
16 years 1 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
CCGRID
2002
IEEE
15 years 11 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
FLAIRS
2004
15 years 8 months ago
Hidden Layer Training via Hessian Matrix Information
The output weight optimization-hidden weight optimization (OWO-HWO) algorithm for training the multilayer perceptron alternately updates the output weights and the hidden weights....
Changhua Yu, Michael T. Manry, Jiang Li
IJCAI
2001
15 years 8 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti