Sciweavers

278 search results - page 27 / 56
» Variants of Spreading Messages
Sort
View
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 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
IUI
2006
ACM
14 years 1 months ago
Automatically classifying emails into activities
Email-based activity management systems promise to give users better tools for managing increasing volumes of email, by organizing email according to a user’s activities. Curren...
Mark Dredze, Tessa A. Lau, Nicholas Kushmerick
INDOCRYPT
2005
Springer
14 years 1 months ago
Short Undeniable Signatures Without Random Oracles: The Missing Link
Abstract. We introduce a new undeniable signature scheme which is existentially unforgeable and anonymous under chosen message attacks in the standard model. The scheme is an embed...
Fabien Laguillaumie, Damien Vergnaud
SAC
1996
ACM
13 years 11 months ago
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...
IWMM
2000
Springer
105views Hardware» more  IWMM 2000»
13 years 11 months ago
Diffusion Tree Restructuring for Indirect Reference Counting
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...
Peter Dickman