Sciweavers

1074 search results - page 122 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Capacity of byzantine agreement with finite link capacity
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...
Guanfeng Liang, Nitin H. Vaidya
PPOPP
1993
ACM
15 years 1 months ago
Experience with Fine-Grain Synchronization in MIMD Machines for Preconditioned Conjugate Gradient
This paper discusses our experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. This algorithm represents a large class of algo...
Donald Yeung, Anant Agarwal
JMLR
2006
103views more  JMLR 2006»
14 years 9 months ago
Pattern Recognition for Conditionally Independent Data
In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
Daniil Ryabko
PRL
2008
118views more  PRL 2008»
14 years 9 months ago
Bayes Machines for binary classification
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
Daniel Hernández-Lobato, José Miguel...
ATS
2010
IEEE
229views Hardware» more  ATS 2010»
14 years 7 months ago
Variation-Aware Fault Modeling
Abstract--To achieve a high product quality for nano-scale systems both realistic defect mechanisms and process variations must be taken into account. While existing approaches for...
Fabian Hopsch, Bernd Becker, Sybille Hellebrand, I...