2252 search results - page 207 / 451 » Improving Random Forests |
133
click to vote
FSE
1997
Springer
15 years 8 months ago
1997
Springer
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel’s ...
134
click to vote
FLAIRS
2007
15 years 6 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
112
click to vote
CEAS
2008
Springer
15 years 5 months ago
2008
Springer
Over the past 5 years, spam sending technology has improved dramatically. Static messages sent opportunistically through misconfigured hosts have evolved into dynamically generate...
103
click to vote
NIPS
2007
15 years 5 months ago
2007
This paper studies boosting algorithms that make a single pass over a set of base classifiers. We first analyze a one-pass algorithm in the setting of boosting with diverse base...
189
click to vote
IJCAI
2003
15 years 5 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...