2924 search results - page 298 / 585 » Lower Bounds in Distributed Computing |
150
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
130
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
145
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
122
click to vote
DCC
2006
IEEE
16 years 4 months ago
2006
IEEE
We give new recursive constructions of complete caps in PG(n, 2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to ...
115
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P(s) = sα . We give a ...