112 search results - page 23 / 23 » Rounds in Communication Complexity Revisited |
ISCAPDCS
2001
13 years 6 months ago
2001
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
TC
2010
13 years 3 months ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...