Sciweavers

1497 search results - page 35 / 300
» A Computational Model for Message Passing
Sort
View
CCE
2005
13 years 9 months ago
Use of parallel computers in rational design of redundant sensor networks
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
Carine Gerkens, Georges Heyen
SIGSOFT
2008
ACM
14 years 10 months ago
Modular verification of web services using efficient symbolic encoding and summarization
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
Fang Yu, Chao Wang, Aarti Gupta, Tevfik Bultan
ICPPW
2005
IEEE
14 years 2 months ago
Load Balancing Hybrid Programming Models for SMP Clusters and Fully Permutable Loops
This paper emphasizes on load balancing issues associated with hybrid programming models for the parallelization of fully permutable nested loops onto SMP clusters. Hybrid paralle...
Nikolaos Drosinos, Nectarios Koziris
JCB
2000
129views more  JCB 2000»
13 years 9 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler
AUSAI
2009
Springer
14 years 3 months ago
Information-Theoretic Image Reconstruction and Segmentation from Noisy Projections
The minimum message length (MML) principle for inductive inference has been successfully applied to image segmentation where the images are modelled by Markov random fields (MRF)....
Gerhard Visser, David L. Dowe, Imants D. Svalbe