2157 search results - page 15 / 432 » Optimal Fast Hashing |
127
click to vote
HPCA
2004
IEEE
16 years 2 months ago
2004
IEEE
Using alternative cache indexing/hashing functions is a popular technique to reduce conflict misses by achieving a more uniform cache access distribution across the sets in the ca...
DAGM
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we present a new method for self-localization on wafers using geometric hashing. The proposed technique is robust to image changes induced by process variations, as o...
118
click to vote
EUROCRYPT
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunctio...
176
Voted
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
112
click to vote
VMV
2003
15 years 3 months ago
2003
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...