903 search results - page 59 / 181 » On the reduction of a random basis |
192
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
184
click to vote
IACR
2011
14 years 5 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
139
click to vote
ICC
2007
IEEE
16 years 14 days ago
2007
IEEE
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
161
click to vote
CSCLP
2004
Springer
15 years 11 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
187
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...