16093 search results - page 129 / 3219 » On the optimality of the neighbor-joining algorithm |
108
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
102
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Hidden Markov Model (HMM) is the dominant technology in speech recognition. The problem of optimizing model parameters is of great interest to the researchers in this area. The Ba...
STOC
1990
ACM
15 years 5 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
101
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper, we propose a new algorithm, named JACC-G, for large scale optimization problems. The motivation is to improve our previous work on grouping and adaptive weightin...
123
click to vote
AINA
2006
IEEE
15 years 7 months ago
2006
IEEE
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...