Sciweavers

12659 search results - page 383 / 2532
» The distributed breakout algorithms
Sort
View
218
Voted
PODC
2012
ACM
13 years 10 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
158
Voted
ICPP
1996
IEEE
15 years 11 months ago
Scalable S-to-P Broadcasting on Message-Passing MPPs
In s-to-p broadcasting, s processors in a p-processor machine contain a message to be broadcast to all the processors, 1 s p. We present a number of different broadcasting algori...
Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu
215
Voted
ICVS
2009
Springer
16 years 2 months ago
A Fast Joint Bioinspired Algorithm for Optic Flow and Two-Dimensional Disparity Estimation
The faithful detection of the motion and of the distance of the objects in the visual scene is a desirable feature of any artificial vision system designed to operate in unknown e...
Manuela Chessa, Silvio P. Sabatini, Fabio Solari
ICPP
2008
IEEE
16 years 2 months ago
Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters
In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems. These systems often have hierarchically s...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
189
Voted
IPPS
2008
IEEE
16 years 1 months ago
Ordered index seed algorithm for intensive DNA sequence comparison
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...
Dominique Lavenier