1301 search results - page 17 / 261 » Bounded Version Vectors |
IJCNN
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present here a hardware–friendly version of the Support Vector Machine (SVM), which is useful to implement its feed–forward phase on limited–resources devices such as ...
ICML
2000
IEEE
16 years 15 days ago
2000
IEEE
We study the problem of learning using combinations of machines. In particular we present new theoretical bounds on the generalization performance of voting ensembles of kernel ma...
102
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
NIPS
2000
15 years 1 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...