219 search results - page 32 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
PODS
2001
ACM
14 years 8 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...
ICC
2009
IEEE
14 years 3 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...
OPODIS
2010
13 years 6 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
ECRTS
2002
IEEE
14 years 1 months ago
2002
IEEE
For priority based buses such as CAN, worst case response time analysis is able to determine whether messages always meet their deadlines. This can include system models with boun...
ICS
2010
Tsinghua U.
14 years 6 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...