1068 search results - page 124 / 214 » Extremely randomized trees |
186
click to vote
PTS
2010
15 years 1 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
139
click to vote
DEBU
2010
14 years 12 months ago
2010
The high random and sequential I/O requirements of contemplated workloads could serve as impetus to move faster towards storage-class memory (SCM), a technology that will blur the...
168
click to vote
FSE
2011
Springer
14 years 6 months ago
2011
Springer
At Eurocrypt 2001, Biryukov and Shamir investigated the security of AES-like ciphers where the substitutions and affine transformations are all key-dependent and successfully crypt...
150
click to vote
MCS
2007
Springer
15 years 9 months ago
2007
Springer
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
143
click to vote
DAGM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...