1262 search results - page 9 / 253 » Fast Robust Hashing |
SPDP
1993
IEEE
13 years 11 months ago
1993
IEEE
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...