Sciweavers

996 search results - page 21 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii
IJCNN
2007
IEEE
14 years 2 months ago
Multi-Stage Optimal Component Analysis
— Optimal component analysis (OCA) uses a stochastic gradient optimization process to find optimal representations for general criteria and shows good performance in object reco...
Yiming Wu, Xiuwen Liu, Washington Mio
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 9 months ago
Estimation of pump-curves using genetic algorithms
This paper presents a variety of different ways of estimating the general parameters for pump-curves. First a formulation is made that converts the problem into estimating four p...
Gerulf K. M. Pedersen, Zhenyu Yang
ACL
1997
13 years 9 months ago
Decoding Algorithm in Statistical Machine Translation
Decoding algorithm is a crucial part in statistical machine translation. We describe a stack decoding algorithm in this paper. We present the hypothesis scoring method and the heu...
Ye-Yi Wang, Alex Waibel
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 8 months ago
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
Serge Gratton, Annick Sartenaer, Philippe L. Toint