2157 search results - page 23 / 432 » Optimal Fast Hashing |
128
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—In a standard multiple choice hashing scheme, each item is stored in one of d ≥ 2 hash table buckets. The availability of choice in where items are stored improves space utili...
117
click to vote
VMV
2007
15 years 3 months ago
2007
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
112
click to vote
NSDI
2010
15 years 3 months ago
2010
We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. These are targeted at emerging data-intensive networked systems that require mas...
102
click to vote
ISW
2004
Springer
15 years 7 months ago
2004
Springer
Security problems in micro-mobility are mostly related to trust establishment between mobile nodes and middle-boxes, i.e. mobile anchor points. In this paper, we present a secure m...