397 search results - page 73 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
SIROCCO
2004
13 years 10 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
ALGORITHMICA
2004
13 years 8 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
DAM
2007
13 years 8 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
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 ...
GIS
2007
ACM
14 years 9 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...