1765 search results - page 152 / 353 » Combinations of Weak Classifiers |
148
click to vote
CC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
137
click to vote
COLT
1999
Springer
15 years 8 months ago
1999
Springer
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
139
click to vote
CSREASAM
2003
15 years 5 months ago
2003
Automated rule induction procedures like machine learning and statistical techniques result in rules that lack generalization and maintainability. Developing rules manually throug...
119
click to vote
CASCON
1993
15 years 5 months ago
1993
In a recent paper, Gale and Church describe an inexpensive method for aligning bitext, based exclusively on sentence lengths [Gale and Church, 1991]. While this method produces su...
130
click to vote
TISSEC
2008
15 years 3 months ago
2008
In commonplace text-based password schemes, users typically choose passwords that are easy to recall, exhibit patterns, and are thus vulnerable to brute-force dictionary attacks. ...