1101 search results - page 183 / 221 » An Algorithm for the Graph Crossing Number Problem |
133
Voted
APCSAC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
136
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
228
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
149
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
161
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...