2924 search results - page 273 / 585 » Lower Bounds in Distributed Computing |
140
click to vote
BICOB
2009
Springer
15 years 10 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
131
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
161
click to vote
WSNA
2003
ACM
15 years 9 months ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
127
click to vote
ROBOCOMM
2007
IEEE
15 years 10 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
121
click to vote
SACRYPT
1999
Springer
15 years 8 months ago
1999
Springer
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m . We call these sequences elliptic curve...