2252 search results - page 53 / 451 » Improving Random Forests |
101
Voted
COLING
2008
15 years 2 months ago
2008
In this paper, we describe a new reranking strategy named word lattice reranking, for the task of joint Chinese word segmentation and part-of-speech (POS) tagging. As a derivation...
86
Voted
ACL
2009
14 years 10 months ago
2009
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
ACL
2009
14 years 10 months ago
2009
Tree-based statistical machine translation models have made significant progress in recent years, especially when replacing 1-best trees with packed forests. However, as the parsi...
234
Voted
ICANN
2011
Springer
14 years 4 months ago
2011
Springer
Attribute importance measures for supervised learning are important for improving both learning accuracy and interpretability. However, it is well-known there could be bias when th...
90
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...