Sciweavers

157 search results - page 11 / 32
» Passing Messages to Lonely Numbers
Sort
View
SPAA
2010
ACM
15 years 2 months ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
TIT
2008
129views more  TIT 2008»
14 years 10 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
ICASSP
2008
IEEE
15 years 4 months ago
A factor graph approach to joint iterative data detection and channel estimation in pilot-assisted IDMA transmissions
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...
Clemens Novak, Gerald Matz, Franz Hlawatsch
IDEAS
2006
IEEE
218views Database» more  IDEAS 2006»
15 years 4 months ago
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudh...
PLDI
2000
ACM
15 years 2 months ago
Translation validation for an optimizing compiler
We describe a translation validation infrastructure for the GNU C compiler. During the compilation the infrastructure compares the intermediate form of the program before and afte...
George C. Necula