776 search results - page 12 / 156 » Distributed Information Regularization on Graphs |
108
click to vote
IEEECIT
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
117
click to vote
INFORMS
1998
15 years 1 days ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
99
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
96
Voted
ICDCS
2000
IEEE
15 years 4 months ago
2000
IEEE
Buffered coscheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved...