Sciweavers

3267 search results - page 524 / 654
» Generalized quasirandom graphs
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 6 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
OSDI
2008
ACM
16 years 6 months ago
Block Mason
The flexibility provided by hardware virtualization allows administrators to rapidly create, destroy, and migrate systems across physical hosts. Unfortunately, the storage systems...
Dutch T. Meyer, Brendan Cully, Jake Wires, Norman ...
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
16 years 6 months ago
LearnPADS: automatic tool generation from ad hoc data
In this demonstration, we will present LEARNPADS, a fully automatic system for generating ad hoc data processing tools. When presented with a collection of ad hoc data, the system...
Kathleen Fisher, David Walker, Kenny Qili Zhu
PODS
2004
ACM
139views Database» more  PODS 2004»
16 years 6 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
PODS
2004
ACM
96views Database» more  PODS 2004»
16 years 6 months ago
Roads, Codes and Spatiotemporal Queries
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...