Sciweavers

502 search results - page 4 / 101
» Deploying a New Hash Algorithm
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 8 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
TVLSI
2008
123views more  TVLSI 2008»
13 years 7 months ago
Cost-Efficient SHA Hardware Accelerators
Abstract--This paper presents a new set of techniques for hardware implementations of Secure Hash Algorithm (SHA) hash functions. These techniques consist mostly in operation resch...
Ricardo Chaves, Georgi Kuzmanov, Leonel Sousa, Sta...
SIGIR
1992
ACM
13 years 11 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
SIGCOMM
2009
ACM
14 years 1 months ago
PLUG: flexible lookup modules for rapid deployment of new protocols in high-speed routers
New protocols for the data link and network layer are being proposed to address limitations of current protocols in terms of scalability, security, and manageability. High-speed r...
Lorenzo De Carli, Yi Pan, Amit Kumar, Cristian Est...
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
14 years 7 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar