Sciweavers

4438 search results - page 28 / 888
» On the Distribution of Keys by Hashing
Sort
View
SIGIR
1992
ACM
15 years 3 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
SPAA
2005
ACM
15 years 5 months ago
Weighted distributed hash tables
Christian Schindelhauer, Gunnar Schomaker
GIS
2009
ACM
16 years 25 days ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah
113
Voted
GI
2001
Springer
15 years 4 months ago
A Simple Key Distribution Method for IEEE 802.11 Encryption Keys
This article proposes a simple key management protocol for the distribution of shared session keys in IEEE 802.11 wireless LANs. For this purpose an individual key for each user i...
Günter Schäfer, Michael Eyrich
SIGCOMM
2006
ACM
15 years 5 months ago
Virtual ring routing: network routing inspired by DHTs
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
Matthew Caesar, Miguel Castro, Edmund B. Nightinga...