1778 search results - page 67 / 356 » On the Power of the Randomized Iterate |
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
JSAC
2008
14 years 9 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
102
click to vote
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...