552 search results - page 27 / 111 » Lower bounds for dynamic connectivity |
159
click to vote
WSC
2007
15 years 8 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....
168
click to vote
RTSS
2005
IEEE
15 years 11 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
146
click to vote
HM
2007
Springer
15 years 12 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
162
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
183
click to vote
JMLR
2012
13 years 8 months ago
2012
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...