Sciweavers

274 search results - page 16 / 55
» Counting lattice vectors
Sort
View
JMLR
2008
104views more  JMLR 2008»
14 years 11 months ago
Nearly Uniform Validation Improves Compression-Based Error Bounds
This paper develops bounds on out-of-sample error rates for support vector machines (SVMs). The bounds are based on the numbers of support vectors in the SVMs rather than on VC di...
Eric Bax
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
15 years 4 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig
TIT
1998
90views more  TIT 1998»
14 years 11 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani
ICIP
2002
IEEE
16 years 1 months ago
Application of support vector machines classifiers to visual speech recognition
In this paper we proposed a visual speech recognition network based on Support Vector Machines. Each word of the dictionary is modeled by a set of temporal sequences of visemes. E...
Mihaela Gordan, Constantine Kotropoulos, Apostolos...
ISITA
2010
14 years 9 months ago
Lattice-reduction aided HNN for vector precoding
In this paper we propose a modication of the Hopeld neural networks for vector precoding, based on Lenstra, Lenstra, and Lov`asz lattice basis reduction. This precoding algorithm c...
Vesna Gardasevic, Ralf R. Müller, Daniel J. R...