150 search results - page 26 / 30 » Jogging over a distance: supporting a |
COCO
2003
Springer
14 years 1 hour ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
ISCA
2007
IEEE
14 years 1 months ago
2007
IEEE
Much like multi-storey buildings in densely packed metropolises, three-dimensional (3D) chip structures are envisioned as a viable solution to skyrocketing transistor densities an...
STOC
2005
ACM
14 years 10 days ago
2005
ACM
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...
VLDB
2004
ACM
14 years 3 days ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...