Results 1  10
of
444
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
with loops (undirected cycles). The algorithm is an exact inference algorithm for singly connected networks the beliefs converge to the cor rect marginals in a number of iterations equal to the diameter of the graph.1 However, as Pearl noted, the same algorithm will not give the correct beliefs for mul
Analysing local algorithms in locationaware quasi unitdisk graphs
, 2011
"... A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unitdisk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs
, 2007
"... Many protocols in distributed computing make use of dominating and connected dominating sets, for example for broadcasting and the computation of routing. Ad hoc networks impose an additional requirement that algorithms for the construction of such sets should be local in the sense that each node of ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
of dominating and connected dominating sets of a Unit Disk Graph (UDG) with location aware nodes (i.e., nodes that know their coordinates in the plane). The size of the constructed set, in the case of the dominating set, is shown to be 5 times the optimal, while for the connected dominating set 7.453 + ɛ
An Optimal Maximal Independent Set Algorithm for BoundedIndependence Graphs
"... We present a novel distributed algorithm for the maximal independent set (MIS) problem. On boundedindependence graphs (BIG) our deterministic algorithm finishes in O(log ∗ n) time, n being the number of nodes. In light of Linial’s Ω(log ∗ n) lower bound our algorithm is asymptotically optimal. Fur ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
. Furthermore, it solves the connected dominating set problem for unit disk graphs in O(log ∗ n) time, exponentially faster than the stateoftheart algorithm. With a new extension our algorithm also computes a δ + 1 coloring and a maximal matching in O(log ∗ n) time, where δ is the maximum degree of the graph.
A LogStar Distributed Maximal Independent Set Algorithm for growthbounded graphs
 PODC'08
, 2008
"... We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growthbounded graphs (GBG) our deterministic algorithm finishes in O(log ∗ n) time, n being the number of nodes. In light of Linial’s Ω(log ∗ n) lower bound our algorithm is asymptotically optimal. Our algori ..."
Abstract

Cited by 75 (15 self)
 Add to MetaCart
algorithm answers prominent open problems in the ad hoc/sensor network domain. For instance, it solves the connected dominating set problem for unit disk graphs in O(log ∗ n) time, exponentially faster than the stateoftheart algorithm. With a new extension our algorithm also computes a δ + 1 coloring
A simple improved distributed algorithm for minimum cds in unit disk graphs
 ACM Transactions on Sensor Networks
, 2005
"... Abstract — Several routing schemes in ad hoc networks first establish a virtual backbone and then route messages via backbone nodes. One common way of constructing such a backbone is based on the construction of a minimum connected dominating set (CDS). In this paper we present a very simple distrib ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
independent set and a minimum CDS in a unit disk graph. This subresult also implies improved approximation factors for many existing algorithm. I.
Approximation algorithms for unit disk graphs
 IN PROCEEDINGS OF THE 31ST INTERNATIONAL WORKSHOP ON GRAPHTHEORETIC CONCEPTS IN COMPUTER SCIENCE
, 2005
"... Mobile ad hoc networks are frequently modeled by unit disk graphs. We consider several classical graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set), which are relevant to such networks. We propose two new notions for u ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Mobile ad hoc networks are frequently modeled by unit disk graphs. We consider several classical graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set), which are relevant to such networks. We propose two new notions
Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
, 2009
"... Abstract⎯The connected dominating set (CDS) problem, which consists of finding a smallest connected dominating set for graphs is an NPhard problem in the unit disk graphs (UDGs). This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set (IS) in ..."
Abstract
 Add to MetaCart
Abstract⎯The connected dominating set (CDS) problem, which consists of finding a smallest connected dominating set for graphs is an NPhard problem in the unit disk graphs (UDGs). This paper focuses on the CDS problem in wireless networks. Investigation of some properties of independent set (IS
Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs
 In Proc. of the 19th International Symposium on Distributed Computing (DISC
, 2005
"... Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time randomized algorithm for general graphs [20], no deterministic polylogarithmic algorithm is known. In this paper, we st ..."
Abstract

Cited by 48 (10 self)
 Add to MetaCart
study the problem in graphs with bounded growth, an important family of graphs which includes the wellknown unit disk graph and many variants thereof. Particularly, we propose a deterministic algorithm that computes a maximal independent set in time O(log ∆ · log∗n) in graphs with bounded growth
Solving Connected Dominating Set Problem in Unit Disk Graphs by Genetic Algorithms
"... Abstract — In this paper, we use Genetic Algorithms to find the Minimum Connected Dominating Set (MCDS) of Unit Disk Graphs (UDG). UDGs are used for modeling adhoc networks and finding MCDS in such graphs is a promising approach to construct an efficient virtual backbone in wireless adhoc networks ..."
Abstract
 Add to MetaCart
Abstract — In this paper, we use Genetic Algorithms to find the Minimum Connected Dominating Set (MCDS) of Unit Disk Graphs (UDG). UDGs are used for modeling adhoc networks and finding MCDS in such graphs is a promising approach to construct an efficient virtual backbone in wireless ad
Results 1  10
of
444