903 search results - page 34 / 181 » On the reduction of a random basis |
100
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
109
click to vote
CRYPTO
2004
Springer
15 years 7 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
112
click to vote
ICDM
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— Support vector machines are very accurate classifiers and have been widely used in many applications. However, the training and to a lesser extent prediction time of s...
113
Voted
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
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...
109
click to vote
DAC
2005
ACM
15 years 3 months ago
2005
ACM
This paper proposes a low power technique, called SBR (Sign Bit Reduction) which may reduce the switching activity in multipliers as well as data buses. Utilizing the multipliers ...