Sciweavers

601 search results - page 98 / 121
» Edge-dominating cycles in graphs
Sort
View
SIROCCO
1997
13 years 10 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
JMLR
2006
148views more  JMLR 2006»
13 years 8 months ago
Walk-Sums and Belief Propagation in Gaussian Graphical Models
We present a new framework based on walks in a graph for analysis and inference in Gaussian graphical models. The key idea is to decompose the correlation between each pair of var...
Dmitry M. Malioutov, Jason K. Johnson, Alan S. Wil...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 2 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
DM
2011
253views Education» more  DM 2011»
13 years 3 months ago
On the hyperbolicity constant in graphs
If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hy...
José M. Rodríguez, Jose Maria Sigarr...
IPMI
2007
Springer
14 years 9 months ago
Comparing Pairwise and Simultaneous Joint Registrations of Decorrelating Interval Exams Using Entropic Graphs
The interest in registering a set of images has quickly risen in the field of medical image analysis. Mutual information (MI) based methods are well-established for pairwise regist...
Bing Ma, Ramkrishnan Narayanan, Hyunjin Park, Alfr...