457 search results - page 8 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
FOCS
2008
IEEE
14 years 1 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...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
WSC
2007
13 years 9 months ago
2007
Recently developed dual techniques allow us to evaluate a given sub-optimal dynamic portfolio policy by using the policy to construct an upper bound on the optimal value function....
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...