2252 search results - page 412 / 451 » Lower Bounds for Dynamic Algorithms |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
VTC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
SIGMOD
2001
ACM
14 years 9 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
SIGMETRICS
2003
ACM
14 years 2 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...