2252 search results - page 64 / 451 » Lower Bounds for Dynamic Algorithms |
148
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
132
Voted
CISS
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
198
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
130
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. This gives rise to dualobjective scheduling problems, where the operating...
112
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...