2745 search results - page 348 / 549 » A fast algorithm for computing large Fibonacci numbers |
142
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
157
click to vote
ICWS
2009
IEEE
16 years 3 months ago
2009
IEEE
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
139
click to vote
ERSHOV
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Text Categorization algorithms have a large number of parameters that determine their behaviour, whose effect is not easily predicted objectively or intuitively and may v...
168
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
In this paper we propose a new information-theoretic divisive algorithm for word clustering applied to text classification. In previous work, such "distributional clustering&...
168
click to vote
KDD
2000
ACM
15 years 9 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...