Sciweavers

12659 search results - page 277 / 2532
» The distributed breakout algorithms
Sort
View
MOC
1998
83views more  MOC 1998»
15 years 6 months ago
A sweep-plane algorithm for generating random tuples in simple polytopes
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
Josef Leydold, Wolfgang Hörmann
ICML
2005
IEEE
16 years 7 months ago
Propagating distributions on a hypergraph by dual information regularization
In the information regularization framework by Corduneanu and Jaakkola (2005), the distributions of labels are propagated on a hypergraph for semi-supervised learning. The learnin...
Koji Tsuda
DCC
2006
IEEE
16 years 6 months ago
On Efficient Quantizer Design for Robust Distributed Source Coding
This paper considers the design of efficient quantizers for a distributed source coding system. The information is encoded at independent terminals and transmitted across separate...
Ankur Saxena, Jayanth Nayak, Kenneth Rose
PRDC
2007
IEEE
16 years 1 months ago
RTG-L: Dependably Scheduling Real-Time Distributable Threads in Large-Scale, Unreliable Networks
We consider scheduling real-time distributable threads in the presence of node/link failures and message losses in large-scale network systems. We present a distributed scheduling...
Kai Han, Binoy Ravindran, E. Douglas Jensen
197
Voted
IPPS
2002
IEEE
15 years 11 months ago
High-Performance Parallel and Distributed Computing for the BMI Eigenvalue Problem
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
Kento Aida, Yoshiaki Futakata, Shinji Hara