Sciweavers

3898 search results - page 59 / 780
» On the Bit Extraction Problem
Sort
View
GECCO
2004
Springer
15 years 3 months ago
Subthreshold-Seeking Behavior and Robust Local Search
Subthreshold-seeking behavior occurs when the majority of the points that an algorithm samples have an evaluation less than some target threshold. We characterize sets of functions...
L. Darrell Whitley, Keith Bush, Jonathan E. Rowe
EUROCRYPT
2000
Springer
15 years 1 months ago
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
We exhibit an attack against a signature scheme recently proposed by Gennaro, Halevi and Rabin [9]. The scheme's security is based on two assumptions namely the strong RSA ass...
Jean-Sébastien Coron, David Naccache
CCCG
2003
14 years 11 months ago
Encoding Quadrilateral Meshes
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...
Asish Mukhopadhyay, Quanbin Jing
ECCC
2000
113views more  ECCC 2000»
14 years 9 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
TIT
2002
120views more  TIT 2002»
14 years 9 months ago
Finite-length analysis of low-density parity-check codes on the binary erasure channel
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expr...
Changyan Di, David Proietti, Ì. Emre Telata...