2157 search results - page 20 / 432 » Optimal Fast Hashing |
105
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
104
click to vote
FSE
2008
Springer
15 years 3 months ago
2008
Springer
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
101
click to vote
IBPRIA
2003
Springer
15 years 7 months ago
2003
Springer
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
118
click to vote
ARITH
2005
IEEE
15 years 3 months ago
2005
IEEE
Hash functions are an important cryptographic primitive. They are used to obtain a fixed-size fingerprint, or hash value, of an arbitrary long message. We focus particularly on ...
92
Voted
IPTPS
2004
Springer
15 years 7 months ago
2004
Springer
Distributed hash tables have been around for a long time [5, 7]. A number of recent projects propose peerto-peer DHTs, based on multi-hop lookup optimizations. Some of these syste...