2283 search results - page 327 / 457 » Bounds of Graph Characteristics |
180
click to vote
PVLDB
2008
15 years 5 months ago
2008
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
143
click to vote
LICS
2008
IEEE
16 years 25 days ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
166
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
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...
193
click to vote
PODS
2001
ACM
16 years 6 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
174
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
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...