397 search results - page 69 / 80 » Pseudorandom Functions and Lattices |
90
Voted
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
DATE
2008
IEEE
15 years 4 months ago
2008
IEEE
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper introduces a class of linear phase lapped biorthogonal transforms with basis functions of variable length VLGLBT. The transform can be characterized by a lattice which ...
IMR
2003
Springer
15 years 2 months ago
2003
Springer
Motivated by Lagrangian simulation of elastic deformation, we propose a new tetrahedral mesh generation algorithm that produces both high quality elements and a mesh that is well ...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a new Genetic Algorithm for Protein Structure Prediction problem in both 2D and 3D hydrophobichydrophilic lattice models, introduced in [1]. Our algorithm evol...