Sciweavers

343 search results - page 20 / 69
» Weighted distributed hash tables
Sort
View
P2P
2009
IEEE
114views Communications» more  P2P 2009»
14 years 3 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
IPTPS
2003
Springer
14 years 1 months ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
TPDS
1998
122views more  TPDS 1998»
13 years 8 months ago
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...
Isidore Rigoutsos, Alex Delis
CHES
2008
Springer
132views Cryptology» more  CHES 2008»
13 years 10 months ago
Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in...
Philipp Grabher, Johann Großschädl, Dan...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 8 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy