495 search results - page 2 / 99 » A variant of the Ford-Johnson algorithm that is more space e... |
COLT
2008
Springer
13 years 7 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
RECOMB
1997
Springer
13 years 9 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
KDD
2004
ACM
14 years 5 months ago
2004
ACM
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. There are several computer programs that align mRNA with its genomic counterpart to determine exon boundaries. Though most of these programs perform such alignment effici...
EMO
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a comprehensive comparison between the performance of state-of-the-art genetic algorithms NSGA-II, SPEA2 and IBEA and their differential evolution based variant...