400 search results - page 14 / 80 » Hard Problem Generation for MKP |
DEXAW
2009
IEEE
14 years 1 months ago
2009
IEEE
A huge amount of schemas are expressed within outdated schema languages which are restricted concerning expressiveness, extensibility, readability, and understandability. Consequen...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— Lattice Reduction (LR) aided MIMO detection has been shown to provide near-optimal hard outputs. However soft outputs are required in practical systems to fully exploit gains f...
IACR
2011
12 years 9 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
CP
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
BMCBI
2010
13 years 10 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...