Sciweavers

658 search results - page 66 / 132
» The Grindahl Hash Functions
Sort
View
TALG
2008
124views more  TALG 2008»
14 years 9 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
CVPR
2007
IEEE
15 years 11 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ISVLSI
2006
IEEE
114views VLSI» more  ISVLSI 2006»
15 years 3 months ago
A Low Power Lookup Technique for Multi-Hashing Network Applications
Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail ...
Ilhan Kaya, Taskin Koçak
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
14 years 11 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
ASAP
2010
IEEE
171views Hardware» more  ASAP 2010»
14 years 10 months ago
General-purpose FPGA platform for efficient encryption and hashing
Many applications require protection of secret or sensitive information, from sensor nodes and embedded applications to large distributed systems. The confidentiality of data can b...
Jakub Szefer, Yu-Yuan Chen, Ruby B. Lee