Sciweavers

502 search results - page 27 / 101
» Deploying a New Hash Algorithm
Sort
View
STOC
2000
ACM
117views Algorithms» more  STOC 2000»
15 years 4 months ago
Faster suffix tree construction with missing suffix links
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
Richard Cole, Ramesh Hariharan
ICWS
2009
IEEE
14 years 9 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang
KDD
2010
ACM
228views Data Mining» more  KDD 2010»
15 years 3 months ago
The new iris data: modular data generators
In this paper we introduce a modular, highly flexible, opensource environment for data generation. Using an existing graphical data flow tool, the user can combine various types...
Iris Adä, Michael R. Berthold
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 5 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
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
16 years 1 months ago
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
Stratos Idreos, Christos Tryfonopoulos, Manolis Ko...