منابع مشابه
Amortized Averaging Algorithms for Approximate Consensus
We introduce a new class of distributed algorithms for the approximate consensus problem in dynamic rooted networks, which we call amortized averaging algorithms. They are deduced from ordinary averaging algorithms by adding a value-gathering phase before each value update. This allows their decision time to drop from being exponential in the number n of processes to being linear under the assu...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملOptimal amortized regret in every interval
Consider the classical problem of predicting the next bit in a sequence of bits. A standard performance measure is regret (loss in payoff) with respect to a set of experts. For example if we measure performance with respect to two constant experts one that always predicts 0’s and another that always predicts 1’s it is well known that one can get regret O( √ T ) with respect to the best expert b...
متن کاملAdditively Homomorphic UC Commitments with Optimal Amortized Overhead
We propose the first UC secure commitment scheme with (amortized) computational complexity linear in the size of the string committed to. After a preprocessing phase based on oblivious transfer, that only needs to be done once and for all, our scheme only requires a pseudorandom generator and a linear code with efficient encoding. We also construct an additively homomorphic version of our basic...
متن کاملDistributed Rational Consensus
The consensus is a very important problem in distributed computing, where among the n players, the honest players try to come to an agreement even in the presence of t malicious players. In game theoretic environment, the group choice problem is similar to the rational consensus problem, where every player pi prefers come to consensus on his value vi or to a value which is as close to it as pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1101