1297 search results - page 51 / 260 » Dynamic Object Process Graphs |
116
Voted
GC
2004
Springer
15 years 7 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
119
click to vote
MICCAI
2010
Springer
15 years 25 days ago
2010
Springer
In this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs ...
117
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
120
click to vote
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
116
click to vote
FASE
2010
Springer
15 years 9 months ago
2010
Springer
Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orde...