Sciweavers

290 search results - page 53 / 58
» Pseudorandom Bits for Polynomials
Sort
View
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
13 years 12 months ago
Pattern-Matching for Strings with Short Descriptions
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...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
GLOBECOM
2008
IEEE
13 years 9 months ago
Blooming Trees for Minimal Perfect Hashing
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...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 8 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
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 ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
TALG
2008
124views more  TALG 2008»
13 years 8 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
IJCES
2002
100views more  IJCES 2002»
13 years 8 months ago
Neural Network Decoders for Linear Block Codes
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...
Ja-Ling Wu, Yuen-Hsien Tseng, Yuh-Ming Huang