2566 search results - page 46 / 514 » The Online Median Problem |
SWAT
1992
Springer
14 years 2 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
INFORMATICALT
2010
13 years 9 months ago
2010
The paper addresses the over-saturated protein spot detection and extraction problem in two-dimensional electrophoresis gel images. The effective technique for detection and recons...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
SIAMCOMP
2012
12 years 1 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
STOC
1997
ACM
14 years 2 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...