3415 search results - page 395 / 683 » Lower bounds on kernelization |
182
click to vote
RECOMB
2007
Springer
16 years 7 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, ...
146
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...
165
click to vote
ICALP
2009
Springer
16 years 7 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...
150
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
160
click to vote
PERCOM
2008
ACM
16 years 6 months ago
2008
ACM
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...