397 search results - page 18 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
PERCOM
2006
ACM
15 years 11 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
107
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
TRANSCI
2011
14 years 6 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract— This paper addresses a problem of finding an optimal dynamic quantizer for nonlinear control subject to discretevalued signal constraints. The quantizers to be studied...