Sciweavers

2270 search results - page 123 / 454
» On the distribution of eigenvalues of graphs
Sort
View
GLOBECOM
2006
IEEE
16 years 12 days ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
IPPS
1998
IEEE
15 years 10 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
CONCUR
2006
Springer
15 years 10 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 4 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 6 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi