Sciweavers

2270 search results - page 127 / 454
» On the distribution of eigenvalues of graphs
Sort
View
GLOBECOM
2007
IEEE
16 years 20 days ago
Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
Ping Chung Ng, David J. Edwards, Soung Chang Liew
NIPS
2007
15 years 7 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
DC
2010
15 years 6 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
RSA
2011
124views more  RSA 2011»
15 years 1 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
ICASSP
2011
IEEE
14 years 10 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski