290 search results - page 53 / 58 » Pseudorandom Bits for Polynomials |
133
Voted
CPM
1995
Springer
15 years 3 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
107
Voted
GLOBECOM
2008
IEEE
15 years 1 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
116
Voted
ALGORITHMICA
2007
15 years 11 days ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
106
Voted
TALG
2008
15 years 5 days ago
2008
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
IJCES
2002
15 years 18 hour ago
2002
This paper presents a class of neural networks suitable for the application of decoding error-correcting codes.The neural model is basically a perceptron with a high-order polynom...