16093 search results - page 377 / 3219 » On the optimality of the neighbor-joining algorithm |
191
click to vote
AMC
2007
15 years 7 months ago
2007
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
192
Voted
PAMI
2008
15 years 6 months ago
2008
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
165
Voted
GECCO
2003
Springer
16 years 2 days ago
2003
Springer
For noisy optimization problems, there is generally a trade-off between the effort spent to reduce the noise (in order to allow the optimization algorithm to run properly), and t...
208
Voted
UAI
2003
15 years 8 months ago
2003
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, the task of selecting the optimal subset of pronunciation variants from a set of automatically generated candidates is recast as a tree search problem. In this appr...