903 search results - page 7 / 181 » On the reduction of a random basis |
EUROCRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
100
click to vote
PKDD
2004
Springer
15 years 5 months ago
2004
Springer
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
75
Voted
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
115
Voted
ACST
2006
15 years 1 months ago
2006
In the last years, there has been an increased investigation of efficient algorithms to solve problems of great scale. The main restriction of the traditional methods, like finite...
112
Voted
SIAMSC
2010
14 years 10 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...