Sciweavers

3008 search results - page 330 / 602
» Independence in connected graphs
Sort
View
201
Voted
PDP
2003
IEEE
16 years 23 days ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
179
Voted
SIROCCO
2008
15 years 9 months ago
Self-stabilizing Cuts in Synchronous Networks
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state ...
Thomas Sauerwald, Dirk Sudholt
UAI
2008
15 years 9 months ago
Inference for Multiplicative Models
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
Ydo Wexler, Christopher Meek
163
Voted
CCCG
2009
15 years 8 months ago
Nucleation-free 3D rigidity
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
Jialong Cheng, Meera Sitharam, Ileana Streinu
INFORMATICALT
2008
93views more  INFORMATICALT 2008»
15 years 7 months ago
Viewcharts: Syntax and Semantics
In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components....
Ayaz Isazadeh, Jaber Karimpour