7758 search results - page 1265 / 1552 » On the Number of Distributive Lattices |
175
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
266
click to vote
VLDB
2004
ACM
16 years 6 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
194
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
216
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Network wide broadcasting in Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. Considering i...
152
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...