Sciweavers

223 search results - page 19 / 45
» Multivariates Polynomials for Hashing
Sort
View
126
Voted
IPPS
1997
IEEE
15 years 7 months ago
Fast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial fx over an arbitrary ring, the shift of fx by c is the operation which computes coefficients of the polynomial fx + c. In this paper we conside...
Eugene V. Zima
212
Voted

Publication
173views
17 years 1 months ago
A Comparison of Hashing Schemes for Address Lookup in Computer Networks
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
R. Jain
ISSAC
2004
Springer
99views Mathematics» more  ISSAC 2004»
15 years 8 months ago
Inversion of parameterized hypersurfaces by means of subresultants
We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in...
Laurent Busé, Carlos D'Andrea
ECCC
2002
74views more  ECCC 2002»
15 years 3 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs
GLOBECOM
2008
IEEE
15 years 4 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,...