2297 search results - page 136 / 460 » A fast APRIORI implementation |
115
click to vote
ASAP
2004
IEEE
15 years 2 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
109
click to vote
ANNPR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
APPROX
2006
Springer
15 years 2 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
FGR
2004
IEEE
15 years 2 months ago
2004
IEEE
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...