44 search results - page 4 / 9 » Basis Reduction, and the Complexity of Branch-and-Bound |
NIPS
1992
15 years 11 days ago
1992
We demonstrate in this paper how certain forms of rule-based knowledge can be used to prestructure a neural network of normalized basis functions and give a probabilistic interpre...
ISITA
2010
14 years 9 months ago
2010
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...
122
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: Protein-protein interactions are ubiquitous and essential for all cellular processes. High-resolution X-ray crystallographic structures of protein complexes can reveal...
115
click to vote
CRYPTO
2011
Springer
13 years 11 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...
104
click to vote
IACR
2011
13 years 11 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...