Sciweavers

397 search results - page 69 / 80
» Pseudorandom Functions and Lattices
Sort
View
ASIACRYPT
2009
Springer
15 years 7 months ago
Security Notions and Generic Constructions for Client Puzzles
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...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
DATE
2008
IEEE
148views Hardware» more  DATE 2008»
15 years 7 months ago
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers
— 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...
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
ICIP
1998
IEEE
16 years 2 months ago
The Variable-Length Generalized Lapped Biorthogonal Transform
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 ...
Trac D. Tran, Ricardo L. de Queiroz, Truong Q. Ngu...
IMR
2003
Springer
15 years 6 months ago
A Crystalline, Red Green Strategy for Meshing Highly Deformable Objects with Tetrahedra
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 ...
Neil Molino, Robert Bridson, Joseph Teran, Ronald ...
GECCO
2008
Springer
164views Optimization» more  GECCO 2008»
15 years 2 months ago
Genetic algorithms with local search optimization for protein structure prediction problem
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...
Igor Berenboym, Mireille Avigal