Sciweavers

794 search results - page 78 / 159
» Challenges in Parallel Graph Processing
Sort
View
PODC
2009
ACM
14 years 3 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
EUROMICRO
1996
IEEE
14 years 1 months ago
Efficient Program Composition on Parix by the Ensemble Methodology
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
John Yiannis Cotronis
ICC
2009
IEEE
143views Communications» more  ICC 2009»
14 years 3 months ago
Low Complexity Markov Chain Monte Carlo Detector for Channels with Intersymbol Interference
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...
Ronghui Peng, Rong-Rong Chen, Behrouz Farhang-Boro...
AAAI
2007
13 years 11 months ago
A Planning Approach for Message-Oriented Semantic Web Service Composition
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
Zhen Liu, Anand Ranganathan, Anton Riabov
DIAL
2006
IEEE
103views Image Analysis» more  DIAL 2006»
14 years 3 months ago
Multi-Queue Merging Scheme And Its Application in Arabic Script Segmentation
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
Pingping Xiu, Liangrui Peng, Xiaoqing Ding