828 search results - page 146 / 166 » Bounded Hairpin Completion |
163
click to vote
ICDCS
2006
IEEE
16 years 6 days ago
2006
IEEE
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
184
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
195
click to vote
ASIACRYPT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
209
click to vote
EDBT
1998
ACM
15 years 10 months ago
1998
ACM
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
167
click to vote
RTSS
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...