Sciweavers

1080 search results - page 75 / 216
» Distributed Hash Tables
Sort
View
TOIS
2002
97views more  TOIS 2002»
15 years 5 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
191
Voted
GLOBECOM
2010
IEEE
15 years 4 months ago
Analysis of Messaging Load in a P2PP Overlay Network under Churn
We analyze the performance of a DHT-based P2P overlay network in resource access and overlay maintenance activities. We use a cross-platform implementation of the protocol called P...
Otso Kassinen, Erkki Harjula, Mika Ylianttila
150
Voted
DCC
2000
IEEE
15 years 6 months ago
Relating Differential Distribution Tables to Other Properties of of Substitution Boxes
Due to the success of differential and linear attacks on a large number of encryption algorithms, it is importanttoinvestigaterelationshipsamongvariouscryptographic, includingdiffe...
Xian-Mo Zhang, Yuliang Zheng, Hideki Imai
156
Voted
INFOCOM
2009
IEEE
16 years 24 days ago
Spatial Distribution in Routing Table Design for Sensor Networks
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
Rik Sarkar, Xianjin Zhu, Jie Gao
COMPGEOM
2004
ACM
15 years 11 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...