2492 search results - page 202 / 499 » On the General Signature Trees |
165
click to vote
ACL
2006
15 years 8 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
172
click to vote
IJCAI
2003
15 years 8 months ago
2003
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
197
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
158
click to vote
COR
2006
15 years 6 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
190
click to vote
JACM
2006
15 years 6 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...