1973 search results - page 17 / 395 » The Construction of Ludic Space |
ESA
2006
Springer
14 years 2 days ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
MLQ
2000
13 years 8 months ago
2000
It is shown, constructively, that the mapping T AT is sequentially continuous with respect to the weak
TIT
2002
13 years 8 months ago
2002
We construct a full data rate space
ISSS
1996
IEEE
14 years 17 days ago
1996
IEEE
In this paper we address a resource