2492 search results - page 66 / 499 » On the General Signature Trees |
KDD
1999
ACM
13 years 12 months ago
1999
ACM
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
TAPD
1998
13 years 9 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
COLOGNETWENTE
2009
13 years 8 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
IANDC
2007
13 years 7 months ago
2007
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...
RECOMB
2001
Springer
14 years 8 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...