Sciweavers

1262 search results - page 23 / 253
» Fast Robust Hashing
Sort
View
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 4 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
ICAS
2009
IEEE
147views Robotics» more  ICAS 2009»
14 years 5 months ago
Fast Estimation of Aggregates in Unstructured Networks
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global sys...
Carlos Baquero, Paulo Sérgio Almeida, Raque...
ICDCS
2008
IEEE
14 years 5 months ago
Fast Path Session Creation on Network Processors
The security gateways today are required not only to block unauthorized accesses by authenticating packet headers, but also by inspecting connection states to defend against malic...
Bo Xu, Yaxuan Qi, Fei He, Zongwei Zhou, Yibo Xue, ...
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 5 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
GIR
2006
ACM
14 years 4 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai