Results 1  10
of
507
Average Consensus in the Presence of Dynamically Changing Directed Topologies and Time Delays
"... Notation and mathematical preliminaries Average consensus in digraphs Ratio consensus Ratio consensus with timedelays ..."
Abstract
 Add to MetaCart
Notation and mathematical preliminaries Average consensus in digraphs Ratio consensus Ratio consensus with timedelays
Examples
"... Notation and mathematical preliminaries Average consensus in digraphs Ratio consensus ..."
Abstract
 Add to MetaCart
Notation and mathematical preliminaries Average consensus in digraphs Ratio consensus
Competitiveness via Consensus
, 2002
"... We introduce Consensus Revenue Estimate (CORE) auctions. This is a class of competitive auctions that is interesting for several reasons. One auction from this class achieves a better competitive ratio than any previously known auction. Another one uses only two random bits, whereas the previously k ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
We introduce Consensus Revenue Estimate (CORE) auctions. This is a class of competitive auctions that is interesting for several reasons. One auction from this class achieves a better competitive ratio than any previously known auction. Another one uses only two random bits, whereas the previously
Coordinated Consensus in Dynamic Networks
"... We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worstcase adversary. The network topology is always connected, but can change completely from one round to the next. The model captures ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
that simultaneous consensus can never be achieved in less than n−1 rounds in any execution, where n is the size of the network; consequently, simultaneous consensus is as hard as computing an upper bound on the number of nodes in the network. For ∆coordinated consensus, we show that if the ratio between nodes
Topology for global average consensus
 in 40th Asilomar Conference on Signals, Systems, and Computers
, 2006
"... We consider the problem of global averageconsensus in a network of sensors. The communication among sensors is restricted by the underlying network, where each sensor can exchange information only with its neighbors. We analyze the influence of the network topology on the convergence speed of the i ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
of the iterative consensus algorithm and focus on the design of network topology with respect to this optimality criterion. Topology optimization is a difficult combinatorial optimization problem. We reduce it to a spectral graph design problem, namely, maximizing the ratio γ of two eigenvalues of the Laplacian
On Delay Optimization in Quorum Consensus
 In Proceedings of the 12th International Symposium on Algorithms and Computation
, 2001
"... The management of replicated data in distributed database systems is a classic problem with great practical importance. Quorum consensus is one of the popular methods, combining with eager replication, for managing replicated data. In this paper, we will investigate the problems of delayoptimal ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The management of replicated data in distributed database systems is a classic problem with great practical importance. Quorum consensus is one of the popular methods, combining with eager replication, for managing replicated data. In this paper, we will investigate the problems of delay
Groupsac: Efficient consensus in the presence of groupings
 In Proceedings of International Conference of Computer Vision
, 2009
"... Figure 1. RANSAC can be significantly sped up if modified to take advantage of additional grouping information between features, e.g., as provided by optical flow based clustering. Left: one of the two images for which we seek epipolar geometry, with inlier and outlier correspondences overlaid in bl ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
in blue and red respectively. Middle and Right: Two largest groups of tentative correspondences after clustering based on feature locations and optical flows. Notice their inlier ratios are much higher than the average ratio in the entire image. We present a novel variant of the RANSAC algorithm
Motion Segmentation by Consensus
"... Abstract—We present a method for merging multiple partitions into a single partition, by minimising the ratio of pairwise agreements and contradictions between the equivalence relations corresponding to the partitions. The number of equivalence classes is determined automatically. This method is adv ..."
Abstract
 Add to MetaCart
Abstract—We present a method for merging multiple partitions into a single partition, by minimising the ratio of pairwise agreements and contradictions between the equivalence relations corresponding to the partitions. The number of equivalence classes is determined automatically. This method
Abstract Competitiveness via Consensus
"... We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each other, but can observe a shared source of random numbers. The goal is to come up with a consensus lower bound on the valu ..."
Abstract
 Add to MetaCart
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each other, but can observe a shared source of random numbers. The goal is to come up with a consensus lower bound
Results 1  10
of
507