Sciweavers

1759 search results - page 350 / 352
» Distributed Paging
Sort
View
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 6 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
COMPGEOM
2006
ACM
13 years 11 months ago
Locked and unlocked chains of planar shapes
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
Robert Connelly, Erik D. Demaine, Martin L. Demain...
IMC
2006
ACM
13 years 11 months ago
Malware prevalence in the KaZaA file-sharing network
In recent years, more than 200 viruses have been reported to use a peer-to-peer (P2P) file-sharing network as a propagation vector. Disguised as files that are frequently exchan...
Seungwon Shin, Jaeyeon Jung, Hari Balakrishnan
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
13 years 11 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
COMPGEOM
2004
ACM
13 years 11 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky