Sciweavers

2270 search results - page 31 / 454
» On the distribution of eigenvalues of graphs
Sort
View
OPODIS
2007
15 years 3 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet
ACSD
2005
IEEE
126views Hardware» more  ACSD 2005»
15 years 7 months ago
Modelling and Analysis of Distributed Simulation Protocols with Distributed Graph Transformation
This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. We use distributed typed attributed g...
Juan de Lara, Gabriele Taentzer
JMLR
2011
145views more  JMLR 2011»
14 years 8 months ago
Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Func
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...
Jim C. Huang, Brendan J. Frey
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
13 years 4 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...