13414 search results - page 380 / 2683 » The distributed boosting algorithm |
168
click to vote
JDA
2006
15 years 6 months ago
2006
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
185
click to vote
ISHPC
2003
Springer
16 years 9 hour ago
2003
Springer
There have been many parallel external sorting algorithms reported such as NOW-Sort, SPsort, and hill sort, etc. They are for sorting large-scale data stored in the disk, but they ...
174
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
171
click to vote
ICDCN
2010
Springer
16 years 1 months ago
2010
Springer
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...
141
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...