2270 search results - page 415 / 454 » On the distribution of eigenvalues of graphs |
117
click to vote
SOCIALCOM
2010
14 years 9 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
108
click to vote
IFIPTM
2009
14 years 9 months ago
2009
In many distributed applications, a party who wishes to make a transaction requires that it has a certain level of trust in the other party. It is frequently the case that the part...
120
click to vote
CPC
2010
14 years 9 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
109
click to vote
TON
2010
14 years 6 months ago
2010
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
106
click to vote
TSP
2010
14 years 6 months ago
2010
Graphical models are a framework for representing and exploiting prior conditional independence structures within distributions using graphs. In the Gaussian case, these models are...