Sciweavers

4438 search results - page 10 / 888
» On the Distribution of Keys by Hashing
Sort
View
HOTOS
2007
IEEE
15 years 3 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
ERLANG
2003
ACM
15 years 5 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
ICIP
2008
IEEE
15 years 6 months ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy
62
Voted
ICDCS
2003
IEEE
15 years 5 months ago
The Hash History Approach for Reconciling Mutual Inconsistency
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
ByungHoon Kang, Robert Wilensky, John Kubiatowicz
GLOBECOM
2010
IEEE
14 years 9 months ago
Secure Cooperation Incentive Scheme with Limited Use of Public Key Cryptography for Multi-Hop Wireless Network
Abstract-Secure cooperation incentive schemes usually use public key cryptography, which incur too heavy overhead to be used efficiently in limited-resource nodes. In this paper, w...
Mohamed Elsalih Mahmoud, Xuemin Shen