Sciweavers

1080 search results - page 55 / 216
» Distributed Hash Tables
Sort
View
SOFSEM
2009
Springer
16 years 1 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
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...
Martin Dietzfelbinger, Ulf Schellbach
WWW
2007
ACM
16 years 5 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
IPPS
2006
IEEE
15 years 11 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
ICIP
2003
IEEE
16 years 6 months ago
Dither-based secure image hashing using distributed coding
We propose an image hashing algorithm that is based on distributed compression principles. The algorithm assumes the availability of a robust feature vector extracted from the ima...
Mark Johnson, Kannan Ramchandran
EUROPAR
2004
Springer
15 years 8 months ago
Enhancing Efficiency of Byzantine-Tolerant Coordination Protocols via Hash Functions
Abstract. Distributed protocols resilient to Byzantine failures are notorious to be costly from the computational and communication point of view. In this paper we discuss the role...
Daniela Tulone