2252 search results - page 8 / 451 » Lower Bounds for Dynamic Algorithms |
AMC
2008
13 years 7 months ago
2008
Several lower bounds have been proposed for the smallest singular value of a square matrix, such as Johnson's bound, Brauer-type bound, Li's bound and Ostrowskitype boun...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
STOC
1991
ACM
13 years 11 months ago
1991
ACM
In this paper, we prove lower bounds on the competitive ratio of randomized algorithms for two on-line problems: the k-server problem, suggested by [MMS], and an on-line motion-pl...
EOR
2006
13 years 7 months ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...