324 search results - page 31 / 65 » Guessing based on length functions |
COCO
2003
Springer
14 years 25 days ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
IACR
2011
12 years 7 months ago
2011
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
DRR
2009
13 years 5 months ago
2009
We describe our work on text-image alignment in context of building a historical document retrieval system. We aim at aligning images of words in handwritten lines with their text...
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
—We present an information retrieval model for combining evidence from concept-based semantics, term statistics, and context for improving search precision of genomics literature...
WINET
2010
13 years 6 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...