1729 search results - page 260 / 346 » Bound Graph Polysemy |
155
click to vote
TVCG
2012
13 years 7 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
135
Voted
STOC
2001
ACM
16 years 5 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...
167
Voted
PODS
2001
ACM
16 years 5 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...
150
Voted
PODS
2004
ACM
16 years 5 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...
128
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...